/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:38:51,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:38:51,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:38:51,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:38:51,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:38:51,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:38:51,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:38:51,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:38:51,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:38:51,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:38:51,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:38:51,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:38:51,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:38:51,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:38:51,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:38:51,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:38:51,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:38:51,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:38:51,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:38:51,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:38:51,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:38:51,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:38:51,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:38:51,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:38:51,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:38:51,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:38:51,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:38:51,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:38:51,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:38:51,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:38:51,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:38:51,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:38:51,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:38:51,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:38:51,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:38:51,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:38:51,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:38:51,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:38:51,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:38:51,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:38:51,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:38:51,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:38:51,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:38:51,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:38:51,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:38:51,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:38:51,531 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:38:51,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:38:51,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:38:51,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:38:51,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:38:51,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:38:51,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:38:51,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:38:51,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:38:51,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:38:51,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:38:51,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:38:51,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:38:51,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:38:51,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:38:51,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:38:51,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:38:51,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:38:51,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:38:51,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:38:51,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:38:51,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:38:51,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:38:51,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:38:51,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:38:51,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:38:51,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:38:51,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:38:51,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:38:51,871 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:38:51,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 02:38:51,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296d91355/6a66bbb00d5b451d8042ef980a0258b7/FLAG8df4c3729 [2019-12-27 02:38:52,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:38:52,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 02:38:52,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296d91355/6a66bbb00d5b451d8042ef980a0258b7/FLAG8df4c3729 [2019-12-27 02:38:52,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296d91355/6a66bbb00d5b451d8042ef980a0258b7 [2019-12-27 02:38:52,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:38:52,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:38:52,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:38:52,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:38:52,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:38:52,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:38:52" (1/1) ... [2019-12-27 02:38:52,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179c38d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:52, skipping insertion in model container [2019-12-27 02:38:52,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:38:52" (1/1) ... [2019-12-27 02:38:52,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:38:52,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:38:53,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:38:53,445 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:38:53,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:38:53,571 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:38:53,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53 WrapperNode [2019-12-27 02:38:53,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:38:53,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:38:53,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:38:53,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:38:53,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:38:53,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:38:53,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:38:53,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:38:53,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... [2019-12-27 02:38:53,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:38:53,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:38:53,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:38:53,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:38:53,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:38:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:38:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:38:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:38:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:38:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:38:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:38:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:38:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:38:53,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:38:53,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:38:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:38:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:38:53,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:38:53,763 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:38:54,486 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:38:54,487 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:38:54,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:38:54 BoogieIcfgContainer [2019-12-27 02:38:54,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:38:54,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:38:54,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:38:54,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:38:54,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:38:52" (1/3) ... [2019-12-27 02:38:54,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347bb777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:38:54, skipping insertion in model container [2019-12-27 02:38:54,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:38:53" (2/3) ... [2019-12-27 02:38:54,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347bb777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:38:54, skipping insertion in model container [2019-12-27 02:38:54,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:38:54" (3/3) ... [2019-12-27 02:38:54,497 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2019-12-27 02:38:54,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:38:54,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:38:54,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:38:54,518 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:38:54,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,583 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:38:54,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:38:54,641 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:38:54,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:38:54,642 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:38:54,642 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:38:54,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:38:54,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:38:54,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:38:54,643 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:38:54,660 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 02:38:54,662 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:38:54,757 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:38:54,757 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:38:54,775 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:38:54,794 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:38:54,882 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:38:54,882 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:38:54,887 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:38:54,901 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 02:38:54,902 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:38:57,642 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-12-27 02:38:59,835 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:38:59,958 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:38:59,976 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-27 02:38:59,976 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 02:38:59,980 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 02:39:00,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-27 02:39:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-27 02:39:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:39:00,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:00,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:00,966 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-27 02:39:00,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:00,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274747647] [2019-12-27 02:39:00,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:01,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274747647] [2019-12-27 02:39:01,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:01,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:39:01,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037543517] [2019-12-27 02:39:01,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:01,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:01,324 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-27 02:39:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:01,741 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-27 02:39:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:01,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:39:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:01,893 INFO L225 Difference]: With dead ends: 16034 [2019-12-27 02:39:01,893 INFO L226 Difference]: Without dead ends: 15698 [2019-12-27 02:39:01,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-27 02:39:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-27 02:39:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-27 02:39:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-27 02:39:03,217 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-27 02:39:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:03,220 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-27 02:39:03,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-27 02:39:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:39:03,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:03,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:03,231 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-27 02:39:03,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:03,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943521693] [2019-12-27 02:39:03,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:03,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943521693] [2019-12-27 02:39:03,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:03,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:39:03,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607837582] [2019-12-27 02:39:03,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:39:03,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:03,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:39:03,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:39:03,396 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-27 02:39:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:04,195 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-27 02:39:04,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:39:04,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:39:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:04,297 INFO L225 Difference]: With dead ends: 24414 [2019-12-27 02:39:04,298 INFO L226 Difference]: Without dead ends: 24400 [2019-12-27 02:39:04,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-27 02:39:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-27 02:39:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-27 02:39:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-27 02:39:05,209 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-27 02:39:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:05,209 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-27 02:39:05,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:39:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-27 02:39:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:39:05,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:05,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:05,212 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-27 02:39:05,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:05,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520376975] [2019-12-27 02:39:05,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:05,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520376975] [2019-12-27 02:39:05,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:05,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:39:05,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878368016] [2019-12-27 02:39:05,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:05,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:05,253 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-27 02:39:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:05,318 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-27 02:39:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:05,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:39:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:05,360 INFO L225 Difference]: With dead ends: 12731 [2019-12-27 02:39:05,360 INFO L226 Difference]: Without dead ends: 12731 [2019-12-27 02:39:05,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-27 02:39:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-27 02:39:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-27 02:39:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-27 02:39:06,649 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-27 02:39:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:06,652 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-27 02:39:06,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-27 02:39:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:39:06,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:06,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:06,663 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-27 02:39:06,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:06,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306584682] [2019-12-27 02:39:06,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:06,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306584682] [2019-12-27 02:39:06,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:06,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:39:06,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630473137] [2019-12-27 02:39:06,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:39:06,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:39:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:39:06,757 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-27 02:39:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:06,779 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-27 02:39:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:39:06,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:39:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:06,784 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 02:39:06,784 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 02:39:06,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:39:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 02:39:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 02:39:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 02:39:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-27 02:39:06,817 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-27 02:39:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:06,817 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-27 02:39:06,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:39:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-27 02:39:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:39:06,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:06,820 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] [2019-12-27 02:39:06,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-27 02:39:06,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:06,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757088861] [2019-12-27 02:39:06,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:06,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757088861] [2019-12-27 02:39:06,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:06,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:39:06,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423958018] [2019-12-27 02:39:06,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:39:06,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:39:06,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:06,938 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-27 02:39:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:06,965 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-27 02:39:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:39:06,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:39:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:06,967 INFO L225 Difference]: With dead ends: 652 [2019-12-27 02:39:06,967 INFO L226 Difference]: Without dead ends: 652 [2019-12-27 02:39:06,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-27 02:39:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-27 02:39:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 02:39:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-27 02:39:06,978 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-27 02:39:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:06,978 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-27 02:39:06,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:39:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-27 02:39:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:06,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:06,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:06,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-27 02:39:06,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:06,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129035520] [2019-12-27 02:39:06,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:07,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129035520] [2019-12-27 02:39:07,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:07,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:39:07,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683286482] [2019-12-27 02:39:07,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:07,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:07,112 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-27 02:39:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:07,159 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-27 02:39:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:07,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:39:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:07,161 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:39:07,161 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:39:07,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:39:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:39:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:39:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-27 02:39:07,171 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-27 02:39:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-27 02:39:07,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-27 02:39:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:07,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:07,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:07,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-27 02:39:07,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:07,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356280610] [2019-12-27 02:39:07,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:07,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356280610] [2019-12-27 02:39:07,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:07,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:39:07,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249459163] [2019-12-27 02:39:07,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:07,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:07,247 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-27 02:39:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:07,310 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-27 02:39:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:07,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:39:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:07,312 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:39:07,312 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:39:07,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:39:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:39:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:39:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-27 02:39:07,322 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-27 02:39:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:07,323 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-27 02:39:07,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-27 02:39:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:07,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:07,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:07,325 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-27 02:39:07,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:07,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083852216] [2019-12-27 02:39:07,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083852216] [2019-12-27 02:39:07,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:07,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:39:07,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523821572] [2019-12-27 02:39:07,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:39:07,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:39:07,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:39:07,426 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-27 02:39:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:07,650 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-27 02:39:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:39:07,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 02:39:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:07,652 INFO L225 Difference]: With dead ends: 893 [2019-12-27 02:39:07,653 INFO L226 Difference]: Without dead ends: 893 [2019-12-27 02:39:07,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:39:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-27 02:39:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-27 02:39:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 02:39:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-27 02:39:07,667 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-27 02:39:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:07,667 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-27 02:39:07,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:39:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-27 02:39:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:07,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:07,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:07,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-27 02:39:07,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:07,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40060705] [2019-12-27 02:39:07,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:07,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40060705] [2019-12-27 02:39:07,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:07,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:39:07,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644696727] [2019-12-27 02:39:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:39:07,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:39:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:39:07,877 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 6 states. [2019-12-27 02:39:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:08,292 INFO L93 Difference]: Finished difference Result 989 states and 2304 transitions. [2019-12-27 02:39:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:39:08,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 02:39:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:08,294 INFO L225 Difference]: With dead ends: 989 [2019-12-27 02:39:08,295 INFO L226 Difference]: Without dead ends: 989 [2019-12-27 02:39:08,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:39:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-27 02:39:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 780. [2019-12-27 02:39:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 02:39:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1832 transitions. [2019-12-27 02:39:08,310 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1832 transitions. Word has length 55 [2019-12-27 02:39:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:08,310 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1832 transitions. [2019-12-27 02:39:08,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:39:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1832 transitions. [2019-12-27 02:39:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:08,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:08,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:08,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2089737911, now seen corresponding path program 3 times [2019-12-27 02:39:08,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:08,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241164671] [2019-12-27 02:39:08,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:08,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241164671] [2019-12-27 02:39:08,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:08,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:39:08,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047615313] [2019-12-27 02:39:08,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:39:08,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:08,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:39:08,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:39:08,419 INFO L87 Difference]: Start difference. First operand 780 states and 1832 transitions. Second operand 6 states. [2019-12-27 02:39:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:08,791 INFO L93 Difference]: Finished difference Result 1297 states and 3013 transitions. [2019-12-27 02:39:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:39:08,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 02:39:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:08,793 INFO L225 Difference]: With dead ends: 1297 [2019-12-27 02:39:08,793 INFO L226 Difference]: Without dead ends: 1297 [2019-12-27 02:39:08,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:39:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-27 02:39:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 840. [2019-12-27 02:39:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 02:39:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1982 transitions. [2019-12-27 02:39:08,807 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1982 transitions. Word has length 55 [2019-12-27 02:39:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:08,807 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1982 transitions. [2019-12-27 02:39:08,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:39:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1982 transitions. [2019-12-27 02:39:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:39:08,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:08,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:08,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1513553193, now seen corresponding path program 4 times [2019-12-27 02:39:08,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:08,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293296667] [2019-12-27 02:39:08,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:08,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293296667] [2019-12-27 02:39:08,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:08,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:39:08,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631489160] [2019-12-27 02:39:08,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:08,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:08,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:08,874 INFO L87 Difference]: Start difference. First operand 840 states and 1982 transitions. Second operand 3 states. [2019-12-27 02:39:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:08,891 INFO L93 Difference]: Finished difference Result 738 states and 1699 transitions. [2019-12-27 02:39:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:08,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:39:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:08,893 INFO L225 Difference]: With dead ends: 738 [2019-12-27 02:39:08,893 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 02:39:08,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 02:39:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-27 02:39:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 02:39:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1699 transitions. [2019-12-27 02:39:08,904 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1699 transitions. Word has length 55 [2019-12-27 02:39:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:08,905 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1699 transitions. [2019-12-27 02:39:08,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1699 transitions. [2019-12-27 02:39:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:39:08,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:08,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:08,907 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -272893927, now seen corresponding path program 1 times [2019-12-27 02:39:08,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:08,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469513067] [2019-12-27 02:39:08,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469513067] [2019-12-27 02:39:08,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:08,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:39:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973121507] [2019-12-27 02:39:08,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:39:08,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:39:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:08,974 INFO L87 Difference]: Start difference. First operand 738 states and 1699 transitions. Second operand 3 states. [2019-12-27 02:39:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:09,015 INFO L93 Difference]: Finished difference Result 738 states and 1698 transitions. [2019-12-27 02:39:09,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:39:09,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 02:39:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:09,017 INFO L225 Difference]: With dead ends: 738 [2019-12-27 02:39:09,017 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 02:39:09,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:39:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 02:39:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 475. [2019-12-27 02:39:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 02:39:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1087 transitions. [2019-12-27 02:39:09,027 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1087 transitions. Word has length 56 [2019-12-27 02:39:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:09,027 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1087 transitions. [2019-12-27 02:39:09,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:39:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1087 transitions. [2019-12-27 02:39:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:39:09,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:09,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:09,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash -897693906, now seen corresponding path program 1 times [2019-12-27 02:39:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:09,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772020603] [2019-12-27 02:39:09,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:09,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772020603] [2019-12-27 02:39:09,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:09,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:39:09,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798441208] [2019-12-27 02:39:09,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:39:09,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:39:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:39:09,186 INFO L87 Difference]: Start difference. First operand 475 states and 1087 transitions. Second operand 7 states. [2019-12-27 02:39:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:09,327 INFO L93 Difference]: Finished difference Result 883 states and 1866 transitions. [2019-12-27 02:39:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:39:09,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 02:39:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:09,328 INFO L225 Difference]: With dead ends: 883 [2019-12-27 02:39:09,329 INFO L226 Difference]: Without dead ends: 580 [2019-12-27 02:39:09,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:39:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-27 02:39:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 413. [2019-12-27 02:39:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 02:39:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 908 transitions. [2019-12-27 02:39:09,341 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 908 transitions. Word has length 57 [2019-12-27 02:39:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:09,341 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 908 transitions. [2019-12-27 02:39:09,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:39:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 908 transitions. [2019-12-27 02:39:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:39:09,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:09,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:09,344 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:09,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 704044892, now seen corresponding path program 2 times [2019-12-27 02:39:09,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:09,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753412845] [2019-12-27 02:39:09,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:09,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753412845] [2019-12-27 02:39:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:09,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:39:09,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538292758] [2019-12-27 02:39:09,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:39:09,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:09,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:39:09,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:39:09,567 INFO L87 Difference]: Start difference. First operand 413 states and 908 transitions. Second operand 6 states. [2019-12-27 02:39:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:09,654 INFO L93 Difference]: Finished difference Result 648 states and 1360 transitions. [2019-12-27 02:39:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:39:09,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 02:39:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:09,656 INFO L225 Difference]: With dead ends: 648 [2019-12-27 02:39:09,656 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 02:39:09,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:39:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 02:39:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-27 02:39:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 02:39:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-27 02:39:09,662 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 57 [2019-12-27 02:39:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:09,662 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-27 02:39:09,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:39:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-27 02:39:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:39:09,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:09,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:09,666 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:09,667 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 3 times [2019-12-27 02:39:09,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:09,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978404355] [2019-12-27 02:39:09,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:39:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:39:09,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978404355] [2019-12-27 02:39:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:39:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:39:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915624075] [2019-12-27 02:39:09,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:39:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:39:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:39:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:39:09,988 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 13 states. [2019-12-27 02:39:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:39:10,504 INFO L93 Difference]: Finished difference Result 370 states and 622 transitions. [2019-12-27 02:39:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:39:10,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 02:39:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:39:10,506 INFO L225 Difference]: With dead ends: 370 [2019-12-27 02:39:10,506 INFO L226 Difference]: Without dead ends: 335 [2019-12-27 02:39:10,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:39:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-27 02:39:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2019-12-27 02:39:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 02:39:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-27 02:39:10,512 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-27 02:39:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:39:10,512 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-27 02:39:10,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:39:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-27 02:39:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:39:10,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:39:10,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:39:10,514 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:39:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:39:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 4 times [2019-12-27 02:39:10,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:39:10,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145301636] [2019-12-27 02:39:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:39:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:39:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:39:10,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:39:10,616 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:39:10,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25|) |v_ULTIMATE.start_main_~#t1214~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1214~0.base_25| 4)) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= v_~z~0_106 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1214~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25| 1) |v_#valid_62|) (= v_~a~0_45 0) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= v_~y$r_buff1_thd0~0_281 0) (= v_~y$w_buff0_used~0_625 0) (= 0 |v_ULTIMATE.start_main_~#t1214~0.offset_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_~#t1214~0.offset=|v_ULTIMATE.start_main_~#t1214~0.offset_19|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1214~0.base=|v_ULTIMATE.start_main_~#t1214~0.base_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1215~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1214~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1215~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1214~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:39:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1215~0.base_13| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1215~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1215~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1215~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13|) |v_ULTIMATE.start_main_~#t1215~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1215~0.base] because there is no mapped edge [2019-12-27 02:39:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1216~0.base_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13|) |v_ULTIMATE.start_main_~#t1216~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1216~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1216~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 02:39:10,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:39:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 02:39:10,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In308082645 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In308082645 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out308082645| ~y$w_buff0_used~0_In308082645) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out308082645| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In308082645, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In308082645} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In308082645, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out308082645|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In308082645} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:39:10,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In642426159 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In642426159 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In642426159 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In642426159 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out642426159| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite12_Out642426159| ~y$w_buff1_used~0_In642426159) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In642426159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642426159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In642426159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642426159} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In642426159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In642426159, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out642426159|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In642426159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In642426159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:39:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-691097028 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-691097028 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-691097028) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-691097028 ~y$r_buff0_thd3~0_Out-691097028) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-691097028, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-691097028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-691097028, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-691097028, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-691097028|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:39:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2143208695 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2143208695 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2143208695 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2143208695 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-2143208695 |P2Thread1of1ForFork0_#t~ite14_Out-2143208695|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-2143208695|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2143208695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143208695, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2143208695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143208695} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2143208695|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2143208695, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2143208695, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2143208695, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2143208695} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:39:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:39:10,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-487317593 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-487317593 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-487317593| ~y~0_In-487317593) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-487317593| ~y$w_buff1~0_In-487317593)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-487317593, ~y$w_buff1~0=~y$w_buff1~0_In-487317593, ~y~0=~y~0_In-487317593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487317593} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-487317593, ~y$w_buff1~0=~y$w_buff1~0_In-487317593, ~y~0=~y~0_In-487317593, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-487317593|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487317593} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:39:10,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:39:10,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In673202687 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In673202687 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out673202687| ~y$w_buff0_used~0_In673202687) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out673202687| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In673202687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In673202687} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In673202687, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In673202687, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out673202687|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:39:10,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-792801952 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-792801952 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-792801952 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-792801952 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out-792801952| ~y$w_buff1_used~0_In-792801952) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-792801952| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-792801952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792801952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-792801952, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792801952} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-792801952, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792801952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-792801952, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-792801952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792801952} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:39:10,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-329296191 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-329296191 256)))) (or (and (= ~y$r_buff0_thd2~0_In-329296191 |P1Thread1of1ForFork2_#t~ite7_Out-329296191|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-329296191|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-329296191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-329296191} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-329296191, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-329296191, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-329296191|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:39:10,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1587374235 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1587374235 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1587374235 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1587374235 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1587374235 |P1Thread1of1ForFork2_#t~ite8_Out-1587374235|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1587374235| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1587374235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587374235, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1587374235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587374235} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1587374235, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587374235, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1587374235|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1587374235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587374235} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:39:10,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:39:10,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:39:10,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In540059782 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In540059782 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out540059782| |ULTIMATE.start_main_#t~ite19_Out540059782|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out540059782| ~y~0_In540059782) .cse2) (and (= |ULTIMATE.start_main_#t~ite18_Out540059782| ~y$w_buff1~0_In540059782) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In540059782, ~y~0=~y~0_In540059782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In540059782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540059782} OutVars{~y$w_buff1~0=~y$w_buff1~0_In540059782, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out540059782|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out540059782|, ~y~0=~y~0_In540059782, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In540059782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540059782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:39:10,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2030693531 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2030693531 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out2030693531|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out2030693531| ~y$w_buff0_used~0_In2030693531)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2030693531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2030693531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2030693531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2030693531, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2030693531|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:39:10,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997197677 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-997197677 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-997197677 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-997197677 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-997197677| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-997197677 |ULTIMATE.start_main_#t~ite21_Out-997197677|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997197677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997197677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997197677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997197677} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-997197677, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997197677, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-997197677|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997197677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997197677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:39:10,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In946888932 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In946888932 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out946888932| ~y$r_buff0_thd0~0_In946888932) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out946888932|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In946888932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946888932} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In946888932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946888932, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out946888932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:39:10,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In323503341 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In323503341 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In323503341 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In323503341 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out323503341|)) (and (= |ULTIMATE.start_main_#t~ite23_Out323503341| ~y$r_buff1_thd0~0_In323503341) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In323503341, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In323503341, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In323503341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In323503341} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In323503341, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In323503341, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In323503341, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out323503341|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In323503341} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:39:10,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-872095199 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-872095199| ~y$w_buff1~0_In-872095199) .cse0 (= |ULTIMATE.start_main_#t~ite32_Out-872095199| |ULTIMATE.start_main_#t~ite33_Out-872095199|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-872095199 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In-872095199 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-872095199 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-872095199 256)) .cse1)))) (and (= ~y$w_buff1~0_In-872095199 |ULTIMATE.start_main_#t~ite33_Out-872095199|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In-872095199| |ULTIMATE.start_main_#t~ite32_Out-872095199|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-872095199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872095199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-872095199, ~weak$$choice2~0=~weak$$choice2~0_In-872095199, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-872095199, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-872095199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872095199} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-872095199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-872095199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-872095199, ~weak$$choice2~0=~weak$$choice2~0_In-872095199, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-872095199|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-872095199, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-872095199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-872095199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 02:39:10,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-667767731 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-667767731| |ULTIMATE.start_main_#t~ite36_Out-667767731|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-667767731 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-667767731 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-667767731 256))) (= (mod ~y$w_buff0_used~0_In-667767731 256) 0))) .cse1 (= ~y$w_buff0_used~0_In-667767731 |ULTIMATE.start_main_#t~ite35_Out-667767731|)) (and (= ~y$w_buff0_used~0_In-667767731 |ULTIMATE.start_main_#t~ite36_Out-667767731|) (= |ULTIMATE.start_main_#t~ite35_In-667767731| |ULTIMATE.start_main_#t~ite35_Out-667767731|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-667767731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-667767731, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-667767731|, ~weak$$choice2~0=~weak$$choice2~0_In-667767731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-667767731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667767731} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-667767731, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-667767731, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-667767731|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-667767731|, ~weak$$choice2~0=~weak$$choice2~0_In-667767731, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-667767731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667767731} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:39:10,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1617366351 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1617366351| ~y$w_buff1_used~0_In-1617366351) (= |ULTIMATE.start_main_#t~ite38_In-1617366351| |ULTIMATE.start_main_#t~ite38_Out-1617366351|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-1617366351| ~y$w_buff1_used~0_In-1617366351) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1617366351 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1617366351 256) 0)) (= (mod ~y$w_buff0_used~0_In-1617366351 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1617366351 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out-1617366351| |ULTIMATE.start_main_#t~ite38_Out-1617366351|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1617366351, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1617366351, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1617366351|, ~weak$$choice2~0=~weak$$choice2~0_In-1617366351, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1617366351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1617366351} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1617366351, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1617366351|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1617366351, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1617366351|, ~weak$$choice2~0=~weak$$choice2~0_In-1617366351, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1617366351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1617366351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:39:10,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:39:10,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:39:10,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:39:10,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:39:10 BasicIcfg [2019-12-27 02:39:10,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:39:10,789 INFO L168 Benchmark]: Toolchain (without parser) took 18012.61 ms. Allocated memory was 145.2 MB in the beginning and 822.1 MB in the end (delta: 676.9 MB). Free memory was 100.5 MB in the beginning and 612.2 MB in the end (delta: -511.8 MB). Peak memory consumption was 540.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,790 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.09 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 157.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.41 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,793 INFO L168 Benchmark]: Boogie Preprocessor took 36.94 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,794 INFO L168 Benchmark]: RCFGBuilder took 811.98 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 105.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,797 INFO L168 Benchmark]: TraceAbstraction took 16297.81 ms. Allocated memory was 203.4 MB in the beginning and 822.1 MB in the end (delta: 618.7 MB). Free memory was 104.7 MB in the beginning and 612.2 MB in the end (delta: -507.5 MB). Peak memory consumption was 486.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:39:10,803 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.09 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 157.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.41 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.94 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.98 ms. Allocated memory is still 203.4 MB. Free memory was 152.1 MB in the beginning and 105.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16297.81 ms. Allocated memory was 203.4 MB in the beginning and 822.1 MB in the end (delta: 618.7 MB). Free memory was 104.7 MB in the beginning and 612.2 MB in the end (delta: -507.5 MB). Peak memory consumption was 486.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1477 SDtfs, 1291 SDslu, 2893 SDs, 0 SdLazy, 1429 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3493 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 109293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...