/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:23:36,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:23:36,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:23:36,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:23:36,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:23:36,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:23:36,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:23:36,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:23:36,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:23:36,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:23:36,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:23:36,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:23:36,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:23:36,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:23:36,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:23:36,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:23:36,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:23:36,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:23:36,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:23:36,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:23:36,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:23:36,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:23:36,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:23:36,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:23:36,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:23:36,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:23:36,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:23:36,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:23:36,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:23:36,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:23:36,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:23:36,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:23:36,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:23:36,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:23:36,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:23:36,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:23:36,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:23:36,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:23:36,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:23:36,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:23:36,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:23:36,547 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-VariableLbe.epf [2019-12-18 21:23:36,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:23:36,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:23:36,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:23:36,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:23:36,572 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:23:36,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:23:36,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:23:36,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:23:36,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:23:36,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:23:36,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:23:36,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:23:36,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:23:36,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:23:36,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:23:36,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:23:36,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:23:36,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:23:36,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:23:36,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:23:36,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:23:36,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:23:36,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:23:36,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:23:36,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:23:36,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:23:36,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:23:36,578 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:23:36,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:23:36,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:23:36,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:23:36,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:23:36,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:23:36,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:23:36,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:23:36,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-18 21:23:36,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa262a124/d263b52ae849461886e4bd24987c0952/FLAGd07197490 [2019-12-18 21:23:37,538 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:23:37,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-18 21:23:37,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa262a124/d263b52ae849461886e4bd24987c0952/FLAGd07197490 [2019-12-18 21:23:37,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa262a124/d263b52ae849461886e4bd24987c0952 [2019-12-18 21:23:37,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:23:37,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:23:37,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:37,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:23:37,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:23:37,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:37" (1/1) ... [2019-12-18 21:23:37,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deafab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:37, skipping insertion in model container [2019-12-18 21:23:37,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:37" (1/1) ... [2019-12-18 21:23:37,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:23:37,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:23:38,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:38,480 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:23:38,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:38,638 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:23:38,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38 WrapperNode [2019-12-18 21:23:38,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:38,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:38,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:23:38,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:23:38,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:38,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:23:38,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:23:38,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:23:38,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (1/1) ... [2019-12-18 21:23:38,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:23:38,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:23:38,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:23:38,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:23:38,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (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-18 21:23:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:23:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:23:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:23:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:23:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:23:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:23:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:23:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:23:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:23:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:23:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:23:38,817 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:23:39,550 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:23:39,550 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:23:39,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:39 BoogieIcfgContainer [2019-12-18 21:23:39,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:23:39,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:23:39,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:23:39,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:23:39,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:23:37" (1/3) ... [2019-12-18 21:23:39,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27949555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:39, skipping insertion in model container [2019-12-18 21:23:39,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:38" (2/3) ... [2019-12-18 21:23:39,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27949555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:39, skipping insertion in model container [2019-12-18 21:23:39,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:39" (3/3) ... [2019-12-18 21:23:39,561 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2019-12-18 21:23:39,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:23:39,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:23:39,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:23:39,581 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:23:39,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,626 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:39,662 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:23:39,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:23:39,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:23:39,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:23:39,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:23:39,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:23:39,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:23:39,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:23:39,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:23:39,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:23:39,701 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:39,795 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:39,796 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:39,809 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:39,827 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:39,865 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:39,865 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:39,870 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:39,883 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 21:23:39,884 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:23:42,862 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:23:42,972 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:23:42,990 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48474 [2019-12-18 21:23:42,990 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 21:23:42,993 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 92 transitions [2019-12-18 21:23:43,462 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-18 21:23:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-18 21:23:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:23:43,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:43,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:23:43,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash 695759593, now seen corresponding path program 1 times [2019-12-18 21:23:43,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:43,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082567196] [2019-12-18 21:23:43,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:43,708 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-18 21:23:43,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082567196] [2019-12-18 21:23:43,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:43,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:23:43,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184583586] [2019-12-18 21:23:43,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:43,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:43,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:43,737 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-18 21:23:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:44,149 INFO L93 Difference]: Finished difference Result 9090 states and 29695 transitions. [2019-12-18 21:23:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:44,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:23:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:44,293 INFO L225 Difference]: With dead ends: 9090 [2019-12-18 21:23:44,293 INFO L226 Difference]: Without dead ends: 8908 [2019-12-18 21:23:44,295 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-18 21:23:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8908 states. [2019-12-18 21:23:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8908 to 8908. [2019-12-18 21:23:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2019-12-18 21:23:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29136 transitions. [2019-12-18 21:23:44,732 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29136 transitions. Word has length 5 [2019-12-18 21:23:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:44,733 INFO L462 AbstractCegarLoop]: Abstraction has 8908 states and 29136 transitions. [2019-12-18 21:23:44,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29136 transitions. [2019-12-18 21:23:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:23:44,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:44,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:44,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1035576107, now seen corresponding path program 1 times [2019-12-18 21:23:44,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:44,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606586055] [2019-12-18 21:23:44,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:44,883 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-18 21:23:44,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606586055] [2019-12-18 21:23:44,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:44,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:44,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053026] [2019-12-18 21:23:44,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:44,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:44,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:44,890 INFO L87 Difference]: Start difference. First operand 8908 states and 29136 transitions. Second operand 4 states. [2019-12-18 21:23:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:45,992 INFO L93 Difference]: Finished difference Result 14155 states and 44019 transitions. [2019-12-18 21:23:45,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:23:45,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:23:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:46,082 INFO L225 Difference]: With dead ends: 14155 [2019-12-18 21:23:46,083 INFO L226 Difference]: Without dead ends: 14148 [2019-12-18 21:23:46,084 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-18 21:23:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2019-12-18 21:23:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 12754. [2019-12-18 21:23:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12754 states. [2019-12-18 21:23:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 40283 transitions. [2019-12-18 21:23:46,556 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 40283 transitions. Word has length 11 [2019-12-18 21:23:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:46,556 INFO L462 AbstractCegarLoop]: Abstraction has 12754 states and 40283 transitions. [2019-12-18 21:23:46,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 40283 transitions. [2019-12-18 21:23:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:23:46,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:46,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:46,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1185448960, now seen corresponding path program 1 times [2019-12-18 21:23:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611343705] [2019-12-18 21:23:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:46,664 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-18 21:23:46,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611343705] [2019-12-18 21:23:46,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:46,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:46,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110041950] [2019-12-18 21:23:46,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:46,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:46,667 INFO L87 Difference]: Start difference. First operand 12754 states and 40283 transitions. Second operand 4 states. [2019-12-18 21:23:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:47,051 INFO L93 Difference]: Finished difference Result 15365 states and 48133 transitions. [2019-12-18 21:23:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:23:47,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:23:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:47,102 INFO L225 Difference]: With dead ends: 15365 [2019-12-18 21:23:47,102 INFO L226 Difference]: Without dead ends: 15365 [2019-12-18 21:23:47,103 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-18 21:23:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15365 states. [2019-12-18 21:23:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15365 to 13687. [2019-12-18 21:23:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13687 states. [2019-12-18 21:23:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 43249 transitions. [2019-12-18 21:23:47,523 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 43249 transitions. Word has length 11 [2019-12-18 21:23:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:47,523 INFO L462 AbstractCegarLoop]: Abstraction has 13687 states and 43249 transitions. [2019-12-18 21:23:47,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 43249 transitions. [2019-12-18 21:23:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:23:47,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:47,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:47,528 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:47,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash 832654764, now seen corresponding path program 1 times [2019-12-18 21:23:47,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:47,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143533946] [2019-12-18 21:23:47,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:47,652 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-18 21:23:47,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143533946] [2019-12-18 21:23:47,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:47,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:47,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901745275] [2019-12-18 21:23:47,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:23:47,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:23:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:47,657 INFO L87 Difference]: Start difference. First operand 13687 states and 43249 transitions. Second operand 5 states. [2019-12-18 21:23:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:48,248 INFO L93 Difference]: Finished difference Result 18440 states and 56874 transitions. [2019-12-18 21:23:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:23:48,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:23:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:48,320 INFO L225 Difference]: With dead ends: 18440 [2019-12-18 21:23:48,321 INFO L226 Difference]: Without dead ends: 18433 [2019-12-18 21:23:48,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:23:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18433 states. [2019-12-18 21:23:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18433 to 13597. [2019-12-18 21:23:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13597 states. [2019-12-18 21:23:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13597 states to 13597 states and 42837 transitions. [2019-12-18 21:23:48,795 INFO L78 Accepts]: Start accepts. Automaton has 13597 states and 42837 transitions. Word has length 17 [2019-12-18 21:23:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:48,796 INFO L462 AbstractCegarLoop]: Abstraction has 13597 states and 42837 transitions. [2019-12-18 21:23:48,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:23:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13597 states and 42837 transitions. [2019-12-18 21:23:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:23:48,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:48,809 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-18 21:23:48,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1895943995, now seen corresponding path program 1 times [2019-12-18 21:23:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:48,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757431905] [2019-12-18 21:23:48,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:48,918 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-18 21:23:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757431905] [2019-12-18 21:23:48,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:48,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:48,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353980711] [2019-12-18 21:23:48,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:48,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:48,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:48,921 INFO L87 Difference]: Start difference. First operand 13597 states and 42837 transitions. Second operand 4 states. [2019-12-18 21:23:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:48,956 INFO L93 Difference]: Finished difference Result 2211 states and 5053 transitions. [2019-12-18 21:23:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:23:48,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:23:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:48,964 INFO L225 Difference]: With dead ends: 2211 [2019-12-18 21:23:48,964 INFO L226 Difference]: Without dead ends: 1925 [2019-12-18 21:23:48,965 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-18 21:23:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-18 21:23:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2019-12-18 21:23:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-12-18 21:23:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 4262 transitions. [2019-12-18 21:23:49,084 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 4262 transitions. Word has length 25 [2019-12-18 21:23:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:49,084 INFO L462 AbstractCegarLoop]: Abstraction has 1925 states and 4262 transitions. [2019-12-18 21:23:49,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 4262 transitions. [2019-12-18 21:23:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:23:49,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:49,088 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] [2019-12-18 21:23:49,088 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 228789501, now seen corresponding path program 1 times [2019-12-18 21:23:49,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:49,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094706113] [2019-12-18 21:23:49,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:49,232 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-18 21:23:49,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094706113] [2019-12-18 21:23:49,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:49,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:23:49,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687834400] [2019-12-18 21:23:49,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:23:49,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:49,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:23:49,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:49,235 INFO L87 Difference]: Start difference. First operand 1925 states and 4262 transitions. Second operand 5 states. [2019-12-18 21:23:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:49,279 INFO L93 Difference]: Finished difference Result 421 states and 770 transitions. [2019-12-18 21:23:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:23:49,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 21:23:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:49,281 INFO L225 Difference]: With dead ends: 421 [2019-12-18 21:23:49,281 INFO L226 Difference]: Without dead ends: 375 [2019-12-18 21:23:49,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:23:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-18 21:23:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 340. [2019-12-18 21:23:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 21:23:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 615 transitions. [2019-12-18 21:23:49,287 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 615 transitions. Word has length 37 [2019-12-18 21:23:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:49,288 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 615 transitions. [2019-12-18 21:23:49,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:23:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 615 transitions. [2019-12-18 21:23:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:23:49,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:49,290 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] [2019-12-18 21:23:49,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1711535056, now seen corresponding path program 1 times [2019-12-18 21:23:49,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:49,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72346423] [2019-12-18 21:23:49,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:49,382 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-18 21:23:49,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72346423] [2019-12-18 21:23:49,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:49,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:49,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706596498] [2019-12-18 21:23:49,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:49,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:49,385 INFO L87 Difference]: Start difference. First operand 340 states and 615 transitions. Second operand 3 states. [2019-12-18 21:23:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:49,435 INFO L93 Difference]: Finished difference Result 354 states and 634 transitions. [2019-12-18 21:23:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:49,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:23:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:49,437 INFO L225 Difference]: With dead ends: 354 [2019-12-18 21:23:49,437 INFO L226 Difference]: Without dead ends: 354 [2019-12-18 21:23:49,438 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-18 21:23:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-18 21:23:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2019-12-18 21:23:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:23:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 630 transitions. [2019-12-18 21:23:49,443 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 630 transitions. Word has length 52 [2019-12-18 21:23:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:49,444 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 630 transitions. [2019-12-18 21:23:49,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 630 transitions. [2019-12-18 21:23:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:23:49,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:49,446 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] [2019-12-18 21:23:49,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2008413200, now seen corresponding path program 1 times [2019-12-18 21:23:49,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:49,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276491707] [2019-12-18 21:23:49,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:49,511 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-18 21:23:49,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276491707] [2019-12-18 21:23:49,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:49,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:49,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112379730] [2019-12-18 21:23:49,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:49,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:49,513 INFO L87 Difference]: Start difference. First operand 350 states and 630 transitions. Second operand 3 states. [2019-12-18 21:23:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:49,525 INFO L93 Difference]: Finished difference Result 350 states and 617 transitions. [2019-12-18 21:23:49,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:49,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:23:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:49,527 INFO L225 Difference]: With dead ends: 350 [2019-12-18 21:23:49,527 INFO L226 Difference]: Without dead ends: 350 [2019-12-18 21:23:49,527 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-18 21:23:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-18 21:23:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-12-18 21:23:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-18 21:23:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 617 transitions. [2019-12-18 21:23:49,532 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 617 transitions. Word has length 52 [2019-12-18 21:23:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:49,533 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 617 transitions. [2019-12-18 21:23:49,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 617 transitions. [2019-12-18 21:23:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:23:49,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:49,534 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] [2019-12-18 21:23:49,534 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash -440282734, now seen corresponding path program 1 times [2019-12-18 21:23:49,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:49,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206427439] [2019-12-18 21:23:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:49,709 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-18 21:23:49,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206427439] [2019-12-18 21:23:49,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:49,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:23:49,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581020554] [2019-12-18 21:23:49,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:23:49,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:23:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:23:49,711 INFO L87 Difference]: Start difference. First operand 350 states and 617 transitions. Second operand 8 states. [2019-12-18 21:23:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:50,185 INFO L93 Difference]: Finished difference Result 541 states and 948 transitions. [2019-12-18 21:23:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:23:50,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 21:23:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:50,187 INFO L225 Difference]: With dead ends: 541 [2019-12-18 21:23:50,187 INFO L226 Difference]: Without dead ends: 541 [2019-12-18 21:23:50,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:23:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-12-18 21:23:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 438. [2019-12-18 21:23:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-18 21:23:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 772 transitions. [2019-12-18 21:23:50,196 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 772 transitions. Word has length 53 [2019-12-18 21:23:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:50,196 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 772 transitions. [2019-12-18 21:23:50,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:23:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 772 transitions. [2019-12-18 21:23:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:23:50,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:50,198 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] [2019-12-18 21:23:50,198 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 783878168, now seen corresponding path program 2 times [2019-12-18 21:23:50,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:50,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485513511] [2019-12-18 21:23:50,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:50,268 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-18 21:23:50,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485513511] [2019-12-18 21:23:50,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:50,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:50,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657172130] [2019-12-18 21:23:50,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:50,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:50,271 INFO L87 Difference]: Start difference. First operand 438 states and 772 transitions. Second operand 3 states. [2019-12-18 21:23:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:50,317 INFO L93 Difference]: Finished difference Result 437 states and 770 transitions. [2019-12-18 21:23:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:50,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 21:23:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:50,318 INFO L225 Difference]: With dead ends: 437 [2019-12-18 21:23:50,319 INFO L226 Difference]: Without dead ends: 437 [2019-12-18 21:23:50,319 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-18 21:23:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-18 21:23:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 349. [2019-12-18 21:23:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-18 21:23:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 606 transitions. [2019-12-18 21:23:50,325 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 606 transitions. Word has length 53 [2019-12-18 21:23:50,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:50,325 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 606 transitions. [2019-12-18 21:23:50,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 606 transitions. [2019-12-18 21:23:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:23:50,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:50,327 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] [2019-12-18 21:23:50,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1094441083, now seen corresponding path program 1 times [2019-12-18 21:23:50,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:50,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541631225] [2019-12-18 21:23:50,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:50,904 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-18 21:23:50,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541631225] [2019-12-18 21:23:50,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:50,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:23:50,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259150181] [2019-12-18 21:23:50,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:23:50,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:23:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:23:50,907 INFO L87 Difference]: Start difference. First operand 349 states and 606 transitions. Second operand 15 states. [2019-12-18 21:23:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:51,977 INFO L93 Difference]: Finished difference Result 797 states and 1407 transitions. [2019-12-18 21:23:51,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:23:51,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 21:23:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:51,979 INFO L225 Difference]: With dead ends: 797 [2019-12-18 21:23:51,979 INFO L226 Difference]: Without dead ends: 222 [2019-12-18 21:23:51,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:23:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-18 21:23:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-18 21:23:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-18 21:23:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 341 transitions. [2019-12-18 21:23:51,984 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 341 transitions. Word has length 54 [2019-12-18 21:23:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:51,984 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 341 transitions. [2019-12-18 21:23:51,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:23:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 341 transitions. [2019-12-18 21:23:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 21:23:51,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:51,985 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] [2019-12-18 21:23:51,986 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1606647941, now seen corresponding path program 2 times [2019-12-18 21:23:51,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:51,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760840221] [2019-12-18 21:23:51,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:23:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:23:52,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:23:52,107 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:23:52,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20| 1)) (= v_~x$r_buff1_thd2~0_17 0) (= v_~x$w_buff1_used~0_63 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~x~0_28 0) (= |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0) (= v_~x$flush_delayed~0_16 0) (= 0 v_~x$r_buff0_thd0~0_78) (= (select .cse0 |v_ULTIMATE.start_main_~#t1091~0.base_20|) 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1091~0.base_20|) |v_ULTIMATE.start_main_~#t1091~0.offset_15| 0)) |v_#memory_int_17|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1091~0.base_20| 4) |v_#length_17|) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~x$w_buff0_used~0_105) (= 0 v_~z~0_9) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd0~0_45 0) (= 0 v_~weak$$choice0~0_6) (= v_~main$tmp_guard0~0_11 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1091~0.base_20|) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~x~0=v_~x~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ULTIMATE.start_main_~#t1091~0.base=|v_ULTIMATE.start_main_~#t1091~0.base_20|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_~#t1091~0.offset=|v_ULTIMATE.start_main_~#t1091~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1092~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1091~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t1091~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 21:23:52,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L789-1-->L791: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1092~0.base_11|) |v_ULTIMATE.start_main_~#t1092~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1092~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1092~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1092~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1092~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1092~0.offset=|v_ULTIMATE.start_main_~#t1092~0.offset_10|, ULTIMATE.start_main_~#t1092~0.base=|v_ULTIMATE.start_main_~#t1092~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1092~0.offset, ULTIMATE.start_main_~#t1092~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:23:52,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_43 v_~x$w_buff0_used~0_72) (= (mod v_~x$w_buff1_used~0_43 256) 0) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 2 v_~x$w_buff0~0_15) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= 1 v_~x$w_buff0_used~0_71) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 21:23:52,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In600809694 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In600809694 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out600809694| |P0Thread1of1ForFork0_#t~ite3_Out600809694|))) (or (and (= ~x$w_buff1~0_In600809694 |P0Thread1of1ForFork0_#t~ite3_Out600809694|) (not .cse0) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out600809694| ~x~0_In600809694) (or .cse0 .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In600809694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In600809694, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In600809694, ~x~0=~x~0_In600809694} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out600809694|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out600809694|, ~x$w_buff1~0=~x$w_buff1~0_In600809694, ~x$w_buff1_used~0=~x$w_buff1_used~0_In600809694, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In600809694, ~x~0=~x~0_In600809694} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:23:52,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1713243622 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1713243622 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1713243622| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1713243622| ~x$w_buff0_used~0_In-1713243622) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1713243622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1713243622} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1713243622|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1713243622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1713243622} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:23:52,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-257557196 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-257557196 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-257557196 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-257557196 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-257557196|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-257557196 |P0Thread1of1ForFork0_#t~ite6_Out-257557196|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-257557196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-257557196, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-257557196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-257557196} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-257557196|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-257557196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-257557196, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-257557196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-257557196} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:23:52,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1074657345 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1074657345 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-1074657345 |P0Thread1of1ForFork0_#t~ite7_Out-1074657345|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1074657345|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1074657345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074657345} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1074657345, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1074657345|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074657345} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:23:52,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1266152697 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1266152697 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1266152697 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1266152697 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1266152697| ~x$r_buff1_thd1~0_In1266152697)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1266152697| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1266152697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1266152697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1266152697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1266152697} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1266152697, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1266152697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1266152697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1266152697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1266152697} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:23:52,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L736-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 21:23:52,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1944993865 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1944993865 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1944993865| 0)) (and (= ~x$w_buff0_used~0_In1944993865 |P1Thread1of1ForFork1_#t~ite11_Out1944993865|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1944993865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944993865} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1944993865|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1944993865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1944993865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:23:52,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In740572185 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In740572185 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In740572185 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In740572185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out740572185| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out740572185| ~x$w_buff1_used~0_In740572185) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In740572185, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In740572185, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In740572185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In740572185} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In740572185, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In740572185, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out740572185|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In740572185, ~x$w_buff0_used~0=~x$w_buff0_used~0_In740572185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:23:52,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-744840912 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-744840912 256)))) (or (and (= ~x$r_buff0_thd2~0_In-744840912 ~x$r_buff0_thd2~0_Out-744840912) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-744840912) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-744840912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-744840912} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-744840912|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-744840912, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-744840912} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:23:52,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1357164366 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1357164366 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1357164366 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1357164366 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1357164366|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1357164366| ~x$r_buff1_thd2~0_In1357164366)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1357164366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1357164366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1357164366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1357164366} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1357164366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1357164366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1357164366, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1357164366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1357164366} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:23:52,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:23:52,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_93 256)) (= 0 (mod v_~x$r_buff0_thd0~0_66 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_66, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:23:52,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2120225756 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2120225756 256) 0))) (or (and (= ~x$w_buff1~0_In-2120225756 |ULTIMATE.start_main_#t~ite17_Out-2120225756|) (not .cse0) (not .cse1)) (and (= ~x~0_In-2120225756 |ULTIMATE.start_main_#t~ite17_Out-2120225756|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2120225756, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2120225756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2120225756, ~x~0=~x~0_In-2120225756} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2120225756|, ~x$w_buff1~0=~x$w_buff1~0_In-2120225756, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2120225756, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2120225756, ~x~0=~x~0_In-2120225756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 21:23:52,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_19 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 21:23:52,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1576770381 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1576770381 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1576770381| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1576770381| ~x$w_buff0_used~0_In-1576770381) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1576770381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1576770381} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1576770381, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1576770381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1576770381} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:23:52,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1863811384 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1863811384 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1863811384 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1863811384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1863811384| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out1863811384| ~x$w_buff1_used~0_In1863811384) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1863811384, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1863811384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1863811384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1863811384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1863811384, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1863811384, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1863811384|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1863811384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1863811384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:23:52,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In197441905 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In197441905 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out197441905| ~x$r_buff0_thd0~0_In197441905) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out197441905| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197441905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In197441905} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In197441905, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out197441905|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In197441905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:23:52,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1996296103 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1996296103 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1996296103 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1996296103 256)))) (or (and (= ~x$r_buff1_thd0~0_In1996296103 |ULTIMATE.start_main_#t~ite22_Out1996296103|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out1996296103| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1996296103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1996296103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1996296103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1996296103} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1996296103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1996296103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1996296103, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1996296103|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1996296103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:23:52,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L810-->L810-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-378382559 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-378382559| ~x$w_buff1~0_In-378382559) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-378382559 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-378382559 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-378382559 256)) .cse0) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-378382559 256))))) (= |ULTIMATE.start_main_#t~ite31_Out-378382559| |ULTIMATE.start_main_#t~ite32_Out-378382559|) .cse1) (and (= |ULTIMATE.start_main_#t~ite32_Out-378382559| ~x$w_buff1~0_In-378382559) (= |ULTIMATE.start_main_#t~ite31_In-378382559| |ULTIMATE.start_main_#t~ite31_Out-378382559|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-378382559, ~x$w_buff1~0=~x$w_buff1~0_In-378382559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378382559, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-378382559, ~weak$$choice2~0=~weak$$choice2~0_In-378382559, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-378382559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-378382559} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-378382559, ~x$w_buff1~0=~x$w_buff1~0_In-378382559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-378382559, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-378382559|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-378382559, ~weak$$choice2~0=~weak$$choice2~0_In-378382559, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-378382559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-378382559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 21:23:52,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In110442354 256)))) (or (and (= ~x$w_buff1_used~0_In110442354 |ULTIMATE.start_main_#t~ite37_Out110442354|) (= |ULTIMATE.start_main_#t~ite38_Out110442354| |ULTIMATE.start_main_#t~ite37_Out110442354|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In110442354 256)))) (or (= (mod ~x$w_buff0_used~0_In110442354 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In110442354 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In110442354 256)))))) (and (= |ULTIMATE.start_main_#t~ite37_In110442354| |ULTIMATE.start_main_#t~ite37_Out110442354|) (not .cse0) (= ~x$w_buff1_used~0_In110442354 |ULTIMATE.start_main_#t~ite38_Out110442354|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110442354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In110442354, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In110442354|, ~weak$$choice2~0=~weak$$choice2~0_In110442354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In110442354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110442354} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In110442354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In110442354, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out110442354|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out110442354|, ~weak$$choice2~0=~weak$$choice2~0_In110442354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In110442354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110442354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:23:52,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~x$r_buff0_thd0~0_53 v_~x$r_buff0_thd0~0_52)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_6|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:23:52,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L816-->L819-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_23) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:23:52,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:23:52,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:23:52 BasicIcfg [2019-12-18 21:23:52,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:23:52,222 INFO L168 Benchmark]: Toolchain (without parser) took 14341.86 ms. Allocated memory was 137.4 MB in the beginning and 622.3 MB in the end (delta: 485.0 MB). Free memory was 100.5 MB in the beginning and 376.2 MB in the end (delta: -275.7 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,223 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.35 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.17 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,231 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,231 INFO L168 Benchmark]: RCFGBuilder took 806.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 106.2 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,232 INFO L168 Benchmark]: TraceAbstraction took 12657.24 ms. Allocated memory was 201.9 MB in the beginning and 622.3 MB in the end (delta: 420.5 MB). Free memory was 105.5 MB in the beginning and 376.2 MB in the end (delta: -270.7 MB). Peak memory consumption was 149.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:52,240 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.48 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.35 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.17 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 106.2 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12657.24 ms. Allocated memory was 201.9 MB in the beginning and 622.3 MB in the end (delta: 420.5 MB). Free memory was 105.5 MB in the beginning and 376.2 MB in the end (delta: -270.7 MB). Peak memory consumption was 149.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 148 ProgramPointsBefore, 80 ProgramPointsAfterwards, 182 TransitionsBefore, 92 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 3580 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48474 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1207 SDtfs, 1190 SDslu, 2356 SDs, 0 SdLazy, 1655 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13687occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 8162 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 59843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...