/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:19:06,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:19:06,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:19:06,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:19:06,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:19:06,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:19:06,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:19:06,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:19:06,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:19:06,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:19:06,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:19:06,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:19:06,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:19:06,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:19:06,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:19:06,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:19:06,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:19:06,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:19:06,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:19:06,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:19:06,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:19:06,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:19:06,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:19:06,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:19:06,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:19:06,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:19:06,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:19:06,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:19:06,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:19:06,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:19:06,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:19:06,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:19:06,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:19:06,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:19:06,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:19:06,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:19:06,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:19:06,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:19:06,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:19:06,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:19:06,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:19:06,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:19:06,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:19:06,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:19:06,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:19:06,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:19:06,602 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:19:06,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:19:06,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:19:06,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:19:06,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:19:06,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:19:06,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:19:06,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:19:06,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:19:06,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:19:06,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:19:06,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:19:06,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:19:06,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:19:06,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:19:06,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:19:06,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:19:06,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:19:06,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:19:06,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:19:06,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:19:06,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:19:06,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:19:06,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:19:06,918 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:19:06,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-27 02:19:06,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc6b4328/d0530b39ae9149dba5f5dfb07e274c99/FLAGfeaf31336 [2019-12-27 02:19:07,532 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:19:07,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2019-12-27 02:19:07,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc6b4328/d0530b39ae9149dba5f5dfb07e274c99/FLAGfeaf31336 [2019-12-27 02:19:07,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc6b4328/d0530b39ae9149dba5f5dfb07e274c99 [2019-12-27 02:19:07,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:19:07,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:19:07,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:19:07,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:19:07,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:19:07,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:19:07" (1/1) ... [2019-12-27 02:19:07,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:07, skipping insertion in model container [2019-12-27 02:19:07,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:19:07" (1/1) ... [2019-12-27 02:19:07,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:19:07,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:19:08,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:19:08,513 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:19:08,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:19:08,648 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:19:08,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08 WrapperNode [2019-12-27 02:19:08,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:19:08,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:19:08,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:19:08,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:19:08,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:19:08,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:19:08,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:19:08,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:19:08,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... [2019-12-27 02:19:08,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:19:08,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:19:08,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:19:08,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:19:08,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:19:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:19:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:19:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:19:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:19:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:19:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:19:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:19:08,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:19:08,835 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:19:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:19:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:19:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:19:08,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:19:08,838 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:19:09,597 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:19:09,598 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:19:09,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:19:09 BoogieIcfgContainer [2019-12-27 02:19:09,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:19:09,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:19:09,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:19:09,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:19:09,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:19:07" (1/3) ... [2019-12-27 02:19:09,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bf3115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:19:09, skipping insertion in model container [2019-12-27 02:19:09,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:19:08" (2/3) ... [2019-12-27 02:19:09,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bf3115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:19:09, skipping insertion in model container [2019-12-27 02:19:09,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:19:09" (3/3) ... [2019-12-27 02:19:09,614 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.oepc.i [2019-12-27 02:19:09,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:19:09,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:19:09,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:19:09,642 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,717 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,717 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,732 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,761 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:19:09,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:19:09,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:19:09,815 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:19:09,816 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:19:09,816 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:19:09,816 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:19:09,816 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:19:09,816 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:19:09,816 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:19:09,832 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 02:19:09,834 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:19:09,933 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:19:09,933 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:19:09,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:19:09,974 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 02:19:10,029 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 02:19:10,029 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:19:10,037 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:19:10,058 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:19:10,059 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:19:15,626 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:19:15,776 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:19:15,942 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-27 02:19:15,942 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 02:19:15,946 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 02:19:34,878 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-27 02:19:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-27 02:19:34,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:19:34,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:34,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:19:34,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:34,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-27 02:19:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925095138] [2019-12-27 02:19:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:35,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925095138] [2019-12-27 02:19:35,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:35,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:19:35,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684418174] [2019-12-27 02:19:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:19:35,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:19:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:35,103 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-27 02:19:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:38,574 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-27 02:19:38,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:19:38,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:19:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:39,217 INFO L225 Difference]: With dead ends: 117122 [2019-12-27 02:19:39,217 INFO L226 Difference]: Without dead ends: 109842 [2019-12-27 02:19:39,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:19:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-27 02:19:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-27 02:19:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-27 02:19:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-27 02:19:47,487 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-27 02:19:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:19:47,487 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-27 02:19:47,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:19:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-27 02:19:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:19:47,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:19:47,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:19:50,927 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:19:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:19:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-27 02:19:50,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:19:50,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85237735] [2019-12-27 02:19:50,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:19:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:19:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:19:51,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85237735] [2019-12-27 02:19:51,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:19:51,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:19:51,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701393023] [2019-12-27 02:19:51,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:19:51,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:19:51,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:19:51,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:19:51,114 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-27 02:19:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:19:52,227 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-27 02:19:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:19:52,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:19:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:19:53,662 INFO L225 Difference]: With dead ends: 170700 [2019-12-27 02:19:53,662 INFO L226 Difference]: Without dead ends: 170651 [2019-12-27 02:19:53,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-27 02:20:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-27 02:20:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-27 02:20:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-27 02:20:08,927 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-27 02:20:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:08,928 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-27 02:20:08,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-27 02:20:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:20:08,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:08,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:08,937 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-27 02:20:08,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:08,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887940267] [2019-12-27 02:20:08,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887940267] [2019-12-27 02:20:09,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919823395] [2019-12-27 02:20:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:09,009 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-27 02:20:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:09,131 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-27 02:20:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:09,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:20:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:09,206 INFO L225 Difference]: With dead ends: 33806 [2019-12-27 02:20:09,206 INFO L226 Difference]: Without dead ends: 33806 [2019-12-27 02:20:09,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-27 02:20:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-27 02:20:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-27 02:20:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-27 02:20:09,843 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-27 02:20:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:09,843 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-27 02:20:09,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-27 02:20:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:20:09,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:09,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:09,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-27 02:20:09,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:09,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915191035] [2019-12-27 02:20:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:09,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915191035] [2019-12-27 02:20:09,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:09,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:09,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231594380] [2019-12-27 02:20:09,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:09,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:09,902 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-27 02:20:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:12,446 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-27 02:20:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:12,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:20:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:12,532 INFO L225 Difference]: With dead ends: 52205 [2019-12-27 02:20:12,533 INFO L226 Difference]: Without dead ends: 52205 [2019-12-27 02:20:12,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-27 02:20:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-27 02:20:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-27 02:20:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-27 02:20:13,334 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-27 02:20:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:13,335 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-27 02:20:13,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-27 02:20:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:20:13,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:13,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:13,339 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-27 02:20:13,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:13,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42772743] [2019-12-27 02:20:13,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:13,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42772743] [2019-12-27 02:20:13,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:13,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:13,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008966883] [2019-12-27 02:20:13,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:13,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:13,426 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-27 02:20:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:13,811 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-27 02:20:13,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:13,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:20:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:13,882 INFO L225 Difference]: With dead ends: 46485 [2019-12-27 02:20:13,882 INFO L226 Difference]: Without dead ends: 46485 [2019-12-27 02:20:13,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-27 02:20:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-27 02:20:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-27 02:20:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-27 02:20:15,009 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-27 02:20:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-27 02:20:15,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-27 02:20:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:20:15,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:15,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:15,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-27 02:20:15,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:15,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641661941] [2019-12-27 02:20:15,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:15,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641661941] [2019-12-27 02:20:15,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:15,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:15,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794951358] [2019-12-27 02:20:15,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:15,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:15,092 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-27 02:20:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:15,442 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-27 02:20:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:15,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:20:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:15,523 INFO L225 Difference]: With dead ends: 51005 [2019-12-27 02:20:15,523 INFO L226 Difference]: Without dead ends: 51005 [2019-12-27 02:20:15,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-27 02:20:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-27 02:20:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-27 02:20:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-27 02:20:16,329 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-27 02:20:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:16,330 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-27 02:20:16,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-27 02:20:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:20:16,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:16,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:16,340 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-27 02:20:16,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:16,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143574459] [2019-12-27 02:20:16,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:16,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143574459] [2019-12-27 02:20:16,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:16,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:16,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120133383] [2019-12-27 02:20:16,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:16,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:16,443 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-27 02:20:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:17,424 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-27 02:20:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:20:17,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:20:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:17,540 INFO L225 Difference]: With dead ends: 60565 [2019-12-27 02:20:17,541 INFO L226 Difference]: Without dead ends: 60558 [2019-12-27 02:20:17,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:20:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-27 02:20:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-27 02:20:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-27 02:20:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-27 02:20:18,408 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-27 02:20:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:18,408 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-27 02:20:18,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-27 02:20:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:20:18,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:18,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:18,418 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-27 02:20:18,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:18,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27263997] [2019-12-27 02:20:18,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:18,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27263997] [2019-12-27 02:20:18,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:18,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:18,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143446950] [2019-12-27 02:20:18,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:18,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:18,508 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-27 02:20:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:19,181 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-27 02:20:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:20:19,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 02:20:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:19,282 INFO L225 Difference]: With dead ends: 63360 [2019-12-27 02:20:19,283 INFO L226 Difference]: Without dead ends: 63353 [2019-12-27 02:20:19,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:20:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-27 02:20:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-27 02:20:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-27 02:20:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-27 02:20:20,491 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-27 02:20:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:20,491 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-27 02:20:20,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-27 02:20:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:20:20,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:20,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:20,505 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-27 02:20:20,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:20,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349399661] [2019-12-27 02:20:20,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:20,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349399661] [2019-12-27 02:20:20,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:20,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:20,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993856636] [2019-12-27 02:20:20,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:20,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:20,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:20,558 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-27 02:20:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:20,660 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-27 02:20:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:20:20,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:20:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:20,709 INFO L225 Difference]: With dead ends: 18121 [2019-12-27 02:20:20,709 INFO L226 Difference]: Without dead ends: 18121 [2019-12-27 02:20:20,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-27 02:20:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-27 02:20:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:20:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-27 02:20:21,143 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-27 02:20:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:21,144 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-27 02:20:21,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-27 02:20:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:20:21,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:21,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:21,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-27 02:20:21,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:21,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210182897] [2019-12-27 02:20:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210182897] [2019-12-27 02:20:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:21,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949586641] [2019-12-27 02:20:21,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:21,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:21,203 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-27 02:20:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:21,291 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-27 02:20:21,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:21,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:20:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:21,320 INFO L225 Difference]: With dead ends: 23499 [2019-12-27 02:20:21,320 INFO L226 Difference]: Without dead ends: 23499 [2019-12-27 02:20:21,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-27 02:20:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-27 02:20:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-27 02:20:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-27 02:20:21,616 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-27 02:20:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:21,616 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-27 02:20:21,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-27 02:20:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:20:21,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:21,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:21,629 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-27 02:20:21,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:21,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071885712] [2019-12-27 02:20:21,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:21,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071885712] [2019-12-27 02:20:21,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:21,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:21,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206496450] [2019-12-27 02:20:21,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:21,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:21,721 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-27 02:20:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:22,046 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-27 02:20:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:20:22,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:20:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:22,076 INFO L225 Difference]: With dead ends: 21964 [2019-12-27 02:20:22,077 INFO L226 Difference]: Without dead ends: 21964 [2019-12-27 02:20:22,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-27 02:20:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-27 02:20:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-27 02:20:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-27 02:20:22,555 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-27 02:20:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:22,555 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-27 02:20:22,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-27 02:20:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:20:22,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:22,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:22,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-27 02:20:22,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:22,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387850089] [2019-12-27 02:20:22,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:22,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387850089] [2019-12-27 02:20:22,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:22,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:22,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317779061] [2019-12-27 02:20:22,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:22,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:22,692 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-27 02:20:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:23,100 INFO L93 Difference]: Finished difference Result 24066 states and 70567 transitions. [2019-12-27 02:20:23,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:20:23,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:20:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:23,132 INFO L225 Difference]: With dead ends: 24066 [2019-12-27 02:20:23,132 INFO L226 Difference]: Without dead ends: 24066 [2019-12-27 02:20:23,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24066 states. [2019-12-27 02:20:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24066 to 20500. [2019-12-27 02:20:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-12-27 02:20:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 60659 transitions. [2019-12-27 02:20:23,469 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 60659 transitions. Word has length 28 [2019-12-27 02:20:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:23,469 INFO L462 AbstractCegarLoop]: Abstraction has 20500 states and 60659 transitions. [2019-12-27 02:20:23,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 60659 transitions. [2019-12-27 02:20:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:20:23,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:23,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:23,491 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-27 02:20:23,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:23,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702198225] [2019-12-27 02:20:23,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:23,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702198225] [2019-12-27 02:20:23,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:23,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:20:23,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53165222] [2019-12-27 02:20:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:20:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:20:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:20:23,659 INFO L87 Difference]: Start difference. First operand 20500 states and 60659 transitions. Second operand 6 states. [2019-12-27 02:20:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:24,416 INFO L93 Difference]: Finished difference Result 27550 states and 80418 transitions. [2019-12-27 02:20:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:20:24,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 02:20:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:24,467 INFO L225 Difference]: With dead ends: 27550 [2019-12-27 02:20:24,467 INFO L226 Difference]: Without dead ends: 27550 [2019-12-27 02:20:24,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:20:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-12-27 02:20:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 21734. [2019-12-27 02:20:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-27 02:20:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64417 transitions. [2019-12-27 02:20:24,883 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64417 transitions. Word has length 33 [2019-12-27 02:20:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:24,883 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64417 transitions. [2019-12-27 02:20:24,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:20:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64417 transitions. [2019-12-27 02:20:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 02:20:24,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:24,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:24,903 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1108508854, now seen corresponding path program 1 times [2019-12-27 02:20:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:24,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703765279] [2019-12-27 02:20:24,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:24,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703765279] [2019-12-27 02:20:24,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:24,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:20:24,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994642015] [2019-12-27 02:20:24,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:20:24,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:20:24,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:20:24,996 INFO L87 Difference]: Start difference. First operand 21734 states and 64417 transitions. Second operand 6 states. [2019-12-27 02:20:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:25,749 INFO L93 Difference]: Finished difference Result 26719 states and 78128 transitions. [2019-12-27 02:20:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:20:25,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 02:20:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:25,789 INFO L225 Difference]: With dead ends: 26719 [2019-12-27 02:20:25,789 INFO L226 Difference]: Without dead ends: 26719 [2019-12-27 02:20:25,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:20:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26719 states. [2019-12-27 02:20:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26719 to 18663. [2019-12-27 02:20:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-27 02:20:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 55458 transitions. [2019-12-27 02:20:26,352 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 55458 transitions. Word has length 34 [2019-12-27 02:20:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:26,353 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 55458 transitions. [2019-12-27 02:20:26,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:20:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 55458 transitions. [2019-12-27 02:20:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:20:26,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:26,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:26,370 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-27 02:20:26,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:26,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731198740] [2019-12-27 02:20:26,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:26,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731198740] [2019-12-27 02:20:26,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:26,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:20:26,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986278109] [2019-12-27 02:20:26,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:26,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:26,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:26,430 INFO L87 Difference]: Start difference. First operand 18663 states and 55458 transitions. Second operand 3 states. [2019-12-27 02:20:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:26,515 INFO L93 Difference]: Finished difference Result 18662 states and 55456 transitions. [2019-12-27 02:20:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:26,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:20:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:26,548 INFO L225 Difference]: With dead ends: 18662 [2019-12-27 02:20:26,549 INFO L226 Difference]: Without dead ends: 18662 [2019-12-27 02:20:26,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18662 states. [2019-12-27 02:20:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18662 to 18662. [2019-12-27 02:20:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18662 states. [2019-12-27 02:20:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18662 states to 18662 states and 55456 transitions. [2019-12-27 02:20:26,858 INFO L78 Accepts]: Start accepts. Automaton has 18662 states and 55456 transitions. Word has length 39 [2019-12-27 02:20:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:26,858 INFO L462 AbstractCegarLoop]: Abstraction has 18662 states and 55456 transitions. [2019-12-27 02:20:26,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18662 states and 55456 transitions. [2019-12-27 02:20:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:20:26,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:26,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:26,879 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-27 02:20:26,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:26,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974498680] [2019-12-27 02:20:26,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:26,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974498680] [2019-12-27 02:20:26,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:26,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:20:26,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525484811] [2019-12-27 02:20:26,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:20:26,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:20:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:26,934 INFO L87 Difference]: Start difference. First operand 18662 states and 55456 transitions. Second operand 5 states. [2019-12-27 02:20:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:27,025 INFO L93 Difference]: Finished difference Result 17460 states and 52769 transitions. [2019-12-27 02:20:27,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:20:27,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:20:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:27,057 INFO L225 Difference]: With dead ends: 17460 [2019-12-27 02:20:27,057 INFO L226 Difference]: Without dead ends: 17460 [2019-12-27 02:20:27,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17460 states. [2019-12-27 02:20:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17460 to 16879. [2019-12-27 02:20:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16879 states. [2019-12-27 02:20:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16879 states to 16879 states and 51200 transitions. [2019-12-27 02:20:27,362 INFO L78 Accepts]: Start accepts. Automaton has 16879 states and 51200 transitions. Word has length 40 [2019-12-27 02:20:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:27,362 INFO L462 AbstractCegarLoop]: Abstraction has 16879 states and 51200 transitions. [2019-12-27 02:20:27,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:20:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16879 states and 51200 transitions. [2019-12-27 02:20:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:20:27,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:27,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:27,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1686455793, now seen corresponding path program 1 times [2019-12-27 02:20:27,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:27,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667621600] [2019-12-27 02:20:27,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:27,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667621600] [2019-12-27 02:20:27,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:27,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:27,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707767464] [2019-12-27 02:20:27,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:27,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:27,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:27,476 INFO L87 Difference]: Start difference. First operand 16879 states and 51200 transitions. Second operand 7 states. [2019-12-27 02:20:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:27,957 INFO L93 Difference]: Finished difference Result 47237 states and 142082 transitions. [2019-12-27 02:20:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:20:27,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:20:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:28,010 INFO L225 Difference]: With dead ends: 47237 [2019-12-27 02:20:28,011 INFO L226 Difference]: Without dead ends: 36742 [2019-12-27 02:20:28,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36742 states. [2019-12-27 02:20:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36742 to 20144. [2019-12-27 02:20:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20144 states. [2019-12-27 02:20:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 61250 transitions. [2019-12-27 02:20:28,493 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 61250 transitions. Word has length 64 [2019-12-27 02:20:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 20144 states and 61250 transitions. [2019-12-27 02:20:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 61250 transitions. [2019-12-27 02:20:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:20:28,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:28,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:28,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash -524205917, now seen corresponding path program 2 times [2019-12-27 02:20:28,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:28,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171145404] [2019-12-27 02:20:28,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:28,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171145404] [2019-12-27 02:20:28,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:28,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:28,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889464266] [2019-12-27 02:20:28,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:28,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:28,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:28,610 INFO L87 Difference]: Start difference. First operand 20144 states and 61250 transitions. Second operand 7 states. [2019-12-27 02:20:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:29,099 INFO L93 Difference]: Finished difference Result 55384 states and 164618 transitions. [2019-12-27 02:20:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:20:29,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:20:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:29,150 INFO L225 Difference]: With dead ends: 55384 [2019-12-27 02:20:29,150 INFO L226 Difference]: Without dead ends: 40425 [2019-12-27 02:20:29,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40425 states. [2019-12-27 02:20:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40425 to 23668. [2019-12-27 02:20:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-12-27 02:20:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 71616 transitions. [2019-12-27 02:20:29,817 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 71616 transitions. Word has length 64 [2019-12-27 02:20:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:29,817 INFO L462 AbstractCegarLoop]: Abstraction has 23668 states and 71616 transitions. [2019-12-27 02:20:29,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 71616 transitions. [2019-12-27 02:20:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:20:29,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:29,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:29,843 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash -817795821, now seen corresponding path program 3 times [2019-12-27 02:20:29,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:29,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128604554] [2019-12-27 02:20:29,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:29,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128604554] [2019-12-27 02:20:29,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:29,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:29,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062846190] [2019-12-27 02:20:29,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:29,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:29,999 INFO L87 Difference]: Start difference. First operand 23668 states and 71616 transitions. Second operand 7 states. [2019-12-27 02:20:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:30,493 INFO L93 Difference]: Finished difference Result 45517 states and 135695 transitions. [2019-12-27 02:20:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:20:30,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:20:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:30,575 INFO L225 Difference]: With dead ends: 45517 [2019-12-27 02:20:30,575 INFO L226 Difference]: Without dead ends: 42806 [2019-12-27 02:20:30,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42806 states. [2019-12-27 02:20:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42806 to 23764. [2019-12-27 02:20:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23764 states. [2019-12-27 02:20:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23764 states to 23764 states and 71960 transitions. [2019-12-27 02:20:31,112 INFO L78 Accepts]: Start accepts. Automaton has 23764 states and 71960 transitions. Word has length 64 [2019-12-27 02:20:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:31,112 INFO L462 AbstractCegarLoop]: Abstraction has 23764 states and 71960 transitions. [2019-12-27 02:20:31,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23764 states and 71960 transitions. [2019-12-27 02:20:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:20:31,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:31,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:31,138 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1121509405, now seen corresponding path program 4 times [2019-12-27 02:20:31,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:31,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999055530] [2019-12-27 02:20:31,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:31,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999055530] [2019-12-27 02:20:31,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:31,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:31,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057644821] [2019-12-27 02:20:31,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:31,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:31,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:31,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:31,196 INFO L87 Difference]: Start difference. First operand 23764 states and 71960 transitions. Second operand 3 states. [2019-12-27 02:20:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:31,330 INFO L93 Difference]: Finished difference Result 28079 states and 85035 transitions. [2019-12-27 02:20:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:31,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:20:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:31,366 INFO L225 Difference]: With dead ends: 28079 [2019-12-27 02:20:31,367 INFO L226 Difference]: Without dead ends: 28079 [2019-12-27 02:20:31,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28079 states. [2019-12-27 02:20:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28079 to 24721. [2019-12-27 02:20:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24721 states. [2019-12-27 02:20:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24721 states to 24721 states and 75123 transitions. [2019-12-27 02:20:31,779 INFO L78 Accepts]: Start accepts. Automaton has 24721 states and 75123 transitions. Word has length 64 [2019-12-27 02:20:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:31,779 INFO L462 AbstractCegarLoop]: Abstraction has 24721 states and 75123 transitions. [2019-12-27 02:20:31,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24721 states and 75123 transitions. [2019-12-27 02:20:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:31,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:31,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:31,805 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash -931220430, now seen corresponding path program 1 times [2019-12-27 02:20:31,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:31,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421812249] [2019-12-27 02:20:31,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421812249] [2019-12-27 02:20:31,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:31,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:20:31,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852323971] [2019-12-27 02:20:31,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:20:31,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:20:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:20:31,893 INFO L87 Difference]: Start difference. First operand 24721 states and 75123 transitions. Second operand 7 states. [2019-12-27 02:20:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:32,578 INFO L93 Difference]: Finished difference Result 50043 states and 151102 transitions. [2019-12-27 02:20:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:20:32,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 02:20:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:32,928 INFO L225 Difference]: With dead ends: 50043 [2019-12-27 02:20:32,928 INFO L226 Difference]: Without dead ends: 46887 [2019-12-27 02:20:32,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46887 states. [2019-12-27 02:20:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46887 to 24847. [2019-12-27 02:20:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24847 states. [2019-12-27 02:20:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24847 states to 24847 states and 75606 transitions. [2019-12-27 02:20:33,503 INFO L78 Accepts]: Start accepts. Automaton has 24847 states and 75606 transitions. Word has length 65 [2019-12-27 02:20:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:33,503 INFO L462 AbstractCegarLoop]: Abstraction has 24847 states and 75606 transitions. [2019-12-27 02:20:33,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:20:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 24847 states and 75606 transitions. [2019-12-27 02:20:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:33,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:33,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:33,543 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2129895652, now seen corresponding path program 2 times [2019-12-27 02:20:33,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:33,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959631516] [2019-12-27 02:20:33,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:33,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959631516] [2019-12-27 02:20:33,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:33,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:20:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13719103] [2019-12-27 02:20:33,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:20:33,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:20:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:20:33,611 INFO L87 Difference]: Start difference. First operand 24847 states and 75606 transitions. Second operand 4 states. [2019-12-27 02:20:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:33,775 INFO L93 Difference]: Finished difference Result 24561 states and 74573 transitions. [2019-12-27 02:20:33,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:20:33,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:20:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:33,822 INFO L225 Difference]: With dead ends: 24561 [2019-12-27 02:20:33,823 INFO L226 Difference]: Without dead ends: 24561 [2019-12-27 02:20:33,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:20:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-27 02:20:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 23604. [2019-12-27 02:20:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23604 states. [2019-12-27 02:20:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23604 states to 23604 states and 71410 transitions. [2019-12-27 02:20:34,274 INFO L78 Accepts]: Start accepts. Automaton has 23604 states and 71410 transitions. Word has length 65 [2019-12-27 02:20:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:34,275 INFO L462 AbstractCegarLoop]: Abstraction has 23604 states and 71410 transitions. [2019-12-27 02:20:34,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:20:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23604 states and 71410 transitions. [2019-12-27 02:20:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:20:34,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:34,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:34,301 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash -788205559, now seen corresponding path program 1 times [2019-12-27 02:20:34,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:34,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505296199] [2019-12-27 02:20:34,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:34,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505296199] [2019-12-27 02:20:34,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:34,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:34,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746474911] [2019-12-27 02:20:34,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:34,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:34,398 INFO L87 Difference]: Start difference. First operand 23604 states and 71410 transitions. Second operand 3 states. [2019-12-27 02:20:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:34,540 INFO L93 Difference]: Finished difference Result 23604 states and 71409 transitions. [2019-12-27 02:20:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:34,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:20:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:34,592 INFO L225 Difference]: With dead ends: 23604 [2019-12-27 02:20:34,593 INFO L226 Difference]: Without dead ends: 23604 [2019-12-27 02:20:34,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23604 states. [2019-12-27 02:20:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23604 to 19228. [2019-12-27 02:20:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19228 states. [2019-12-27 02:20:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19228 states to 19228 states and 59308 transitions. [2019-12-27 02:20:35,071 INFO L78 Accepts]: Start accepts. Automaton has 19228 states and 59308 transitions. Word has length 65 [2019-12-27 02:20:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:35,072 INFO L462 AbstractCegarLoop]: Abstraction has 19228 states and 59308 transitions. [2019-12-27 02:20:35,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19228 states and 59308 transitions. [2019-12-27 02:20:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:20:35,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:35,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:35,094 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-27 02:20:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:35,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486675270] [2019-12-27 02:20:35,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:35,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486675270] [2019-12-27 02:20:35,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:35,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:20:35,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544925319] [2019-12-27 02:20:35,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:20:35,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:20:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:35,157 INFO L87 Difference]: Start difference. First operand 19228 states and 59308 transitions. Second operand 3 states. [2019-12-27 02:20:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:35,232 INFO L93 Difference]: Finished difference Result 15945 states and 48065 transitions. [2019-12-27 02:20:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:20:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:20:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:35,259 INFO L225 Difference]: With dead ends: 15945 [2019-12-27 02:20:35,260 INFO L226 Difference]: Without dead ends: 15945 [2019-12-27 02:20:35,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:20:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2019-12-27 02:20:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 14321. [2019-12-27 02:20:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-27 02:20:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 43147 transitions. [2019-12-27 02:20:35,504 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 43147 transitions. Word has length 66 [2019-12-27 02:20:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:35,504 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 43147 transitions. [2019-12-27 02:20:35,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:20:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 43147 transitions. [2019-12-27 02:20:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:35,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:35,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:35,519 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-27 02:20:35,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:35,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365460799] [2019-12-27 02:20:35,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:36,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365460799] [2019-12-27 02:20:36,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:36,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:20:36,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224562842] [2019-12-27 02:20:36,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:20:36,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:36,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:20:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:20:36,068 INFO L87 Difference]: Start difference. First operand 14321 states and 43147 transitions. Second operand 15 states. [2019-12-27 02:20:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:40,894 INFO L93 Difference]: Finished difference Result 36736 states and 107764 transitions. [2019-12-27 02:20:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 02:20:40,895 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 02:20:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:40,934 INFO L225 Difference]: With dead ends: 36736 [2019-12-27 02:20:40,934 INFO L226 Difference]: Without dead ends: 30644 [2019-12-27 02:20:40,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=633, Invalid=3527, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 02:20:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30644 states. [2019-12-27 02:20:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30644 to 15352. [2019-12-27 02:20:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15352 states. [2019-12-27 02:20:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15352 states to 15352 states and 45956 transitions. [2019-12-27 02:20:41,276 INFO L78 Accepts]: Start accepts. Automaton has 15352 states and 45956 transitions. Word has length 67 [2019-12-27 02:20:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:41,276 INFO L462 AbstractCegarLoop]: Abstraction has 15352 states and 45956 transitions. [2019-12-27 02:20:41,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:20:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15352 states and 45956 transitions. [2019-12-27 02:20:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:41,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:41,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:41,292 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 426570281, now seen corresponding path program 2 times [2019-12-27 02:20:41,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:41,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437711442] [2019-12-27 02:20:41,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:41,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437711442] [2019-12-27 02:20:41,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:41,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:20:41,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827117550] [2019-12-27 02:20:41,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:20:41,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:20:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:20:41,477 INFO L87 Difference]: Start difference. First operand 15352 states and 45956 transitions. Second operand 10 states. [2019-12-27 02:20:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:42,411 INFO L93 Difference]: Finished difference Result 34652 states and 102444 transitions. [2019-12-27 02:20:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 02:20:42,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:20:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:42,447 INFO L225 Difference]: With dead ends: 34652 [2019-12-27 02:20:42,447 INFO L226 Difference]: Without dead ends: 26550 [2019-12-27 02:20:42,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:20:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-12-27 02:20:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 15202. [2019-12-27 02:20:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15202 states. [2019-12-27 02:20:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15202 states to 15202 states and 45302 transitions. [2019-12-27 02:20:42,752 INFO L78 Accepts]: Start accepts. Automaton has 15202 states and 45302 transitions. Word has length 67 [2019-12-27 02:20:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:42,752 INFO L462 AbstractCegarLoop]: Abstraction has 15202 states and 45302 transitions. [2019-12-27 02:20:42,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:20:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 15202 states and 45302 transitions. [2019-12-27 02:20:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:42,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:42,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:42,768 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2051549039, now seen corresponding path program 3 times [2019-12-27 02:20:42,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:42,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109118153] [2019-12-27 02:20:42,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:43,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109118153] [2019-12-27 02:20:43,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:43,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:20:43,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632229519] [2019-12-27 02:20:43,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 02:20:43,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:43,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 02:20:43,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:20:43,109 INFO L87 Difference]: Start difference. First operand 15202 states and 45302 transitions. Second operand 14 states. [2019-12-27 02:20:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:45,545 INFO L93 Difference]: Finished difference Result 24424 states and 71960 transitions. [2019-12-27 02:20:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 02:20:45,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 02:20:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:45,574 INFO L225 Difference]: With dead ends: 24424 [2019-12-27 02:20:45,574 INFO L226 Difference]: Without dead ends: 20098 [2019-12-27 02:20:45,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-27 02:20:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20098 states. [2019-12-27 02:20:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20098 to 15232. [2019-12-27 02:20:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15232 states. [2019-12-27 02:20:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 45253 transitions. [2019-12-27 02:20:45,842 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 45253 transitions. Word has length 67 [2019-12-27 02:20:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:45,842 INFO L462 AbstractCegarLoop]: Abstraction has 15232 states and 45253 transitions. [2019-12-27 02:20:45,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 02:20:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 45253 transitions. [2019-12-27 02:20:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:45,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:45,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:45,857 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1369493627, now seen corresponding path program 4 times [2019-12-27 02:20:45,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:45,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343332746] [2019-12-27 02:20:45,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:46,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343332746] [2019-12-27 02:20:46,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:46,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:20:46,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049400100] [2019-12-27 02:20:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:20:46,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:20:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:20:46,016 INFO L87 Difference]: Start difference. First operand 15232 states and 45253 transitions. Second operand 11 states. [2019-12-27 02:20:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:47,059 INFO L93 Difference]: Finished difference Result 28654 states and 84439 transitions. [2019-12-27 02:20:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:20:47,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:20:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:47,092 INFO L225 Difference]: With dead ends: 28654 [2019-12-27 02:20:47,093 INFO L226 Difference]: Without dead ends: 25449 [2019-12-27 02:20:47,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:20:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-27 02:20:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 14606. [2019-12-27 02:20:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14606 states. [2019-12-27 02:20:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 43533 transitions. [2019-12-27 02:20:47,397 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 43533 transitions. Word has length 67 [2019-12-27 02:20:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:47,398 INFO L462 AbstractCegarLoop]: Abstraction has 14606 states and 43533 transitions. [2019-12-27 02:20:47,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:20:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 43533 transitions. [2019-12-27 02:20:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:47,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:47,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:47,412 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1595697243, now seen corresponding path program 5 times [2019-12-27 02:20:47,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:47,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712740106] [2019-12-27 02:20:47,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:20:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:20:47,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712740106] [2019-12-27 02:20:47,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:20:47,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:20:47,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043849857] [2019-12-27 02:20:47,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:20:47,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:20:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:20:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:20:47,588 INFO L87 Difference]: Start difference. First operand 14606 states and 43533 transitions. Second operand 11 states. [2019-12-27 02:20:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:20:48,593 INFO L93 Difference]: Finished difference Result 25796 states and 76046 transitions. [2019-12-27 02:20:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:20:48,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:20:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:20:48,626 INFO L225 Difference]: With dead ends: 25796 [2019-12-27 02:20:48,627 INFO L226 Difference]: Without dead ends: 25385 [2019-12-27 02:20:48,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:20:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25385 states. [2019-12-27 02:20:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25385 to 14330. [2019-12-27 02:20:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14330 states. [2019-12-27 02:20:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14330 states to 14330 states and 42736 transitions. [2019-12-27 02:20:48,926 INFO L78 Accepts]: Start accepts. Automaton has 14330 states and 42736 transitions. Word has length 67 [2019-12-27 02:20:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:20:48,926 INFO L462 AbstractCegarLoop]: Abstraction has 14330 states and 42736 transitions. [2019-12-27 02:20:48,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:20:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14330 states and 42736 transitions. [2019-12-27 02:20:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:20:48,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:20:48,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:20:48,940 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:20:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:20:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 6 times [2019-12-27 02:20:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:20:48,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438139000] [2019-12-27 02:20:48,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:20:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:20:49,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:20:49,049 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:20:49,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= |v_ULTIMATE.start_main_~#t925~0.offset_22| 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30| 1) |v_#valid_67|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30|) 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30|) |v_ULTIMATE.start_main_~#t925~0.offset_22| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t925~0.base_30| 4)) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t925~0.base_30|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ULTIMATE.start_main_~#t925~0.base=|v_ULTIMATE.start_main_~#t925~0.base_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t925~0.offset=|v_ULTIMATE.start_main_~#t925~0.offset_22|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t926~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t926~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t927~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t925~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t927~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t925~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 02:20:49,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff1_thd3~0_Out-295161390 ~a$r_buff0_thd3~0_In-295161390) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-295161390 0)) (= ~a$r_buff0_thd2~0_In-295161390 ~a$r_buff1_thd2~0_Out-295161390) (= ~a$r_buff0_thd1~0_In-295161390 ~a$r_buff1_thd1~0_Out-295161390) (= 1 ~a$r_buff0_thd1~0_Out-295161390) (= ~x~0_In-295161390 ~__unbuffered_p0_EAX~0_Out-295161390) (= ~a$r_buff0_thd0~0_In-295161390 ~a$r_buff1_thd0~0_Out-295161390)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-295161390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-295161390, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-295161390, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-295161390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-295161390, ~x~0=~x~0_In-295161390} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-295161390, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-295161390, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-295161390, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-295161390, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-295161390, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-295161390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-295161390, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-295161390, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-295161390, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-295161390, ~x~0=~x~0_In-295161390} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:20:49,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11|) |v_ULTIMATE.start_main_~#t926~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t926~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t926~0.base_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t926~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t926~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_10|, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t926~0.offset, ULTIMATE.start_main_~#t926~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:20:49,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_ULTIMATE.start_main_~#t927~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t927~0.base_11|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t927~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t927~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11|) |v_ULTIMATE.start_main_~#t927~0.offset_10| 2))) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_11|, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t927~0.base, ULTIMATE.start_main_~#t927~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 02:20:49,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1635829192 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1635829192 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1635829192| ~a$w_buff1~0_In-1635829192) (not .cse1)) (and (= ~a~0_In-1635829192 |P1Thread1of1ForFork2_#t~ite9_Out-1635829192|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1635829192, ~a$w_buff1~0=~a$w_buff1~0_In-1635829192, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1635829192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192} OutVars{~a~0=~a~0_In-1635829192, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1635829192|, ~a$w_buff1~0=~a$w_buff1~0_In-1635829192, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1635829192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 02:20:49,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 02:20:49,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-727637169 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-727637169 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-727637169| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-727637169| ~a$w_buff0_used~0_In-727637169)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-727637169|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 02:20:49,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1872517423 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1872517423 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1872517423 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1872517423 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1872517423| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1872517423| ~a$w_buff1_used~0_In-1872517423) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1872517423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1872517423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1872517423, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1872517423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1872517423|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872517423} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 02:20:49,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In77656374 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In77656374 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out77656374|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In77656374 |P1Thread1of1ForFork2_#t~ite13_Out77656374|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out77656374|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 02:20:49,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-2037189931 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2037189931 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-2037189931 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2037189931 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2037189931|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-2037189931 |P1Thread1of1ForFork2_#t~ite14_Out-2037189931|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2037189931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2037189931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037189931} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2037189931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2037189931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037189931, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2037189931|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 02:20:49,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:20:49,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1029118692 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1029118692 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1029118692|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1029118692 |P0Thread1of1ForFork1_#t~ite5_Out-1029118692|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1029118692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1029118692} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1029118692|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1029118692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1029118692} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 02:20:49,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-2095434072 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2095434072 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2095434072 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-2095434072 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-2095434072|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-2095434072 |P0Thread1of1ForFork1_#t~ite6_Out-2095434072|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2095434072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2095434072, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2095434072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2095434072} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2095434072|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2095434072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2095434072, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2095434072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2095434072} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 02:20:49,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1450636835 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1450636835 256)))) (or (and (= ~a$r_buff0_thd1~0_Out1450636835 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out1450636835 ~a$r_buff0_thd1~0_In1450636835) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1450636835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1450636835} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1450636835|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1450636835, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1450636835} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:20:49,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2013713030 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In2013713030 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In2013713030 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In2013713030 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In2013713030 |P0Thread1of1ForFork1_#t~ite8_Out2013713030|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out2013713030|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2013713030|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:20:49,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:20:49,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1488185254 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1488185254 256)))) (or (= (mod ~a$w_buff0_used~0_In1488185254 256) 0) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1488185254 256))) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1488185254 256))))) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1488185254| ~a$w_buff1_used~0_In1488185254) (= |P2Thread1of1ForFork0_#t~ite30_Out1488185254| |P2Thread1of1ForFork0_#t~ite29_Out1488185254|)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1488185254| |P2Thread1of1ForFork0_#t~ite29_Out1488185254|) (= |P2Thread1of1ForFork0_#t~ite30_Out1488185254| ~a$w_buff1_used~0_In1488185254) (not .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1488185254, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1488185254, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1488185254, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1488185254, ~weak$$choice2~0=~weak$$choice2~0_In1488185254, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1488185254|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1488185254, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1488185254, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1488185254, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1488185254, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1488185254|, ~weak$$choice2~0=~weak$$choice2~0_In1488185254, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1488185254|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 02:20:49,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 02:20:49,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 02:20:49,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1976366894 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1976366894 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1976366894| ~a~0_In1976366894) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1976366894| ~a$w_buff1~0_In1976366894)))) InVars {~a~0=~a~0_In1976366894, ~a$w_buff1~0=~a$w_buff1~0_In1976366894, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1976366894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976366894} OutVars{~a~0=~a~0_In1976366894, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1976366894|, ~a$w_buff1~0=~a$w_buff1~0_In1976366894, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1976366894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1976366894} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:20:49,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 02:20:49,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1943800216 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1943800216 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1943800216|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1943800216 |P2Thread1of1ForFork0_#t~ite40_Out-1943800216|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1943800216|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 02:20:49,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1103504950 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1103504950 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1103504950 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1103504950 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1103504950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1103504950| ~a$w_buff1_used~0_In-1103504950) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1103504950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1103504950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1103504950, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1103504950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1103504950, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1103504950|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 02:20:49,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In560331282 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In560331282 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out560331282| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out560331282| ~a$r_buff0_thd3~0_In560331282) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In560331282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In560331282} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In560331282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In560331282, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out560331282|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 02:20:49,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1449270991 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1449270991 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1449270991 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1449270991 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1449270991|)) (and (= ~a$r_buff1_thd3~0_In-1449270991 |P2Thread1of1ForFork0_#t~ite43_Out-1449270991|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1449270991|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1449270991, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1449270991, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1449270991} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 02:20:49,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:20:49,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:20:49,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In474435593 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In474435593 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out474435593| |ULTIMATE.start_main_#t~ite47_Out474435593|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out474435593| ~a$w_buff1~0_In474435593) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~a~0_In474435593 |ULTIMATE.start_main_#t~ite47_Out474435593|)))) InVars {~a~0=~a~0_In474435593, ~a$w_buff1~0=~a$w_buff1~0_In474435593, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In474435593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In474435593} OutVars{~a~0=~a~0_In474435593, ~a$w_buff1~0=~a$w_buff1~0_In474435593, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out474435593|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In474435593, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out474435593|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In474435593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:20:49,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-518629399 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-518629399 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-518629399| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-518629399| ~a$w_buff0_used~0_In-518629399)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-518629399} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-518629399|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-518629399} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:20:49,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-2127019036 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-2127019036 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2127019036 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-2127019036 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-2127019036 |ULTIMATE.start_main_#t~ite50_Out-2127019036|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-2127019036| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2127019036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2127019036, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2127019036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2127019036} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2127019036|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2127019036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2127019036, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2127019036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2127019036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:20:49,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1472120494 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1472120494 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1472120494|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1472120494 |ULTIMATE.start_main_#t~ite51_Out1472120494|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1472120494} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1472120494|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1472120494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:20:49,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In2139128170 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In2139128170 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2139128170 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In2139128170 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out2139128170| ~a$r_buff1_thd0~0_In2139128170)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out2139128170| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2139128170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2139128170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139128170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2139128170} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2139128170|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2139128170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2139128170, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139128170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2139128170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:20:49,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:20:49,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:20:49 BasicIcfg [2019-12-27 02:20:49,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:20:49,202 INFO L168 Benchmark]: Toolchain (without parser) took 101320.89 ms. Allocated memory was 140.0 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,202 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.61 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 157.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,207 INFO L168 Benchmark]: Boogie Preprocessor took 42.52 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,208 INFO L168 Benchmark]: RCFGBuilder took 841.30 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 101.3 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,208 INFO L168 Benchmark]: TraceAbstraction took 99597.49 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 02:20:49,214 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.61 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 157.1 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.52 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.30 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 101.3 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99597.49 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t925, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t926, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t927, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.2s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7312 SDtfs, 8443 SDslu, 25638 SDs, 0 SdLazy, 11588 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 37 SyntacticMatches, 20 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 237579 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 279219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...