/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:27,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:27,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:27,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:27,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:27,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:27,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:27,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:27,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:27,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:27,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:27,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:27,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:27,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:27,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:27,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:27,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:27,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:27,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:27,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:27,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:27,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:27,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:27,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:27,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:27,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:27,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:27,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:27,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:27,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:27,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:27,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:27,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:27,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:27,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:27,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:27,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:27,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:27,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:27,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:27,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:27,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:12:27,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:27,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:27,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:27,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:27,431 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:27,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:27,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:27,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:27,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:27,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:27,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:27,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:27,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:27,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:27,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:27,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:27,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:27,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:27,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:27,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:27,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:27,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:27,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:27,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:27,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:27,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:27,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:27,438 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:27,438 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:27,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:27,439 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:27,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:27,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:27,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:27,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:27,712 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:27,713 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:27,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-27 21:12:27,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e537ec1/f2b764aa33874be0835e2a7370d39b54/FLAG919480405 [2019-12-27 21:12:28,427 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:12:28,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.oepc.i [2019-12-27 21:12:28,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e537ec1/f2b764aa33874be0835e2a7370d39b54/FLAG919480405 [2019-12-27 21:12:28,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94e537ec1/f2b764aa33874be0835e2a7370d39b54 [2019-12-27 21:12:28,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:12:28,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:12:28,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:28,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:12:28,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:12:28,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:28" (1/1) ... [2019-12-27 21:12:28,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e752d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:28, skipping insertion in model container [2019-12-27 21:12:28,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:28" (1/1) ... [2019-12-27 21:12:28,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:12:28,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:12:29,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:29,236 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:12:29,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:29,393 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:12:29,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29 WrapperNode [2019-12-27 21:12:29,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:29,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:29,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:12:29,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:12:29,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:29,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:12:29,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:12:29,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:12:29,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (1/1) ... [2019-12-27 21:12:29,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:12:29,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:12:29,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:12:29,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:12:29,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (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 21:12:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:12:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:12:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:12:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:12:29,576 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:12:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:12:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:12:29,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:12:29,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:12:29,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:12:29,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:12:29,580 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 21:12:30,291 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:12:30,292 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:12:30,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:30 BoogieIcfgContainer [2019-12-27 21:12:30,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:12:30,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:12:30,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:12:30,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:12:30,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:12:28" (1/3) ... [2019-12-27 21:12:30,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d3070e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:30, skipping insertion in model container [2019-12-27 21:12:30,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:29" (2/3) ... [2019-12-27 21:12:30,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d3070e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:30, skipping insertion in model container [2019-12-27 21:12:30,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:30" (3/3) ... [2019-12-27 21:12:30,304 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc.i [2019-12-27 21:12:30,315 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:12:30,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:12:30,326 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:12:30,327 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:12:30,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,424 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:30,460 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:12:30,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:12:30,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:12:30,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:12:30,478 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:12:30,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:12:30,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:12:30,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:12:30,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:12:30,496 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:12:30,498 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:30,588 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:30,589 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:30,601 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:30,621 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:12:30,672 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:12:30,672 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:30,681 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:12:30,698 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:12:30,699 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:33,839 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:12:33,952 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:12:33,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49804 [2019-12-27 21:12:33,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 21:12:33,982 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 21:12:34,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 21:12:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 21:12:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:12:34,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:34,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:12:34,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash 792295, now seen corresponding path program 1 times [2019-12-27 21:12:34,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:34,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072552600] [2019-12-27 21:12:34,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:34,628 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 21:12:34,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072552600] [2019-12-27 21:12:34,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:34,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:12:34,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649724506] [2019-12-27 21:12:34,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:34,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:34,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:12:34,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:34,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:34,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:34,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:34,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:34,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:34,667 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 21:12:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:34,998 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 21:12:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:35,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:12:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:35,081 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 21:12:35,081 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 21:12:35,083 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 21:12:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 21:12:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 21:12:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 21:12:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 21:12:35,577 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 21:12:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:35,578 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 21:12:35,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 21:12:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:12:35,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:35,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:35,582 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1331077168, now seen corresponding path program 1 times [2019-12-27 21:12:35,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:35,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160729858] [2019-12-27 21:12:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:35,671 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 21:12:35,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160729858] [2019-12-27 21:12:35,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:35,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:35,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1612085809] [2019-12-27 21:12:35,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:35,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:35,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:12:35,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:35,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:35,680 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 21:12:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:35,703 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 21:12:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:35,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:12:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:35,710 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 21:12:35,711 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 21:12:35,712 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 21:12:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 21:12:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 21:12:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:12:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 21:12:35,745 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 21:12:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:35,746 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 21:12:35,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 21:12:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:35,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:35,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:35,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 265392593, now seen corresponding path program 1 times [2019-12-27 21:12:35,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:35,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476560374] [2019-12-27 21:12:35,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:35,844 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 21:12:35,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476560374] [2019-12-27 21:12:35,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:35,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:35,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765062754] [2019-12-27 21:12:35,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:35,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:35,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:35,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:35,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:35,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:35,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:35,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:35,853 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 21:12:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:35,927 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 21:12:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:35,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 21:12:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:35,939 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 21:12:35,939 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 21:12:35,939 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 21:12:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 21:12:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 21:12:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 21:12:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 21:12:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 21:12:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:36,042 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 21:12:36,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 21:12:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:36,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:36,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:36,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 175245027, now seen corresponding path program 1 times [2019-12-27 21:12:36,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:36,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626236809] [2019-12-27 21:12:36,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:36,173 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 21:12:36,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626236809] [2019-12-27 21:12:36,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:36,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:36,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [525060825] [2019-12-27 21:12:36,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:36,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:36,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:36,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:36,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:36,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:36,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:36,180 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 21:12:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:36,339 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 21:12:36,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:36,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:36,348 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 21:12:36,348 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 21:12:36,349 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 21:12:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 21:12:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 21:12:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 21:12:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 21:12:36,392 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 21:12:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:36,392 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 21:12:36,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 21:12:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:12:36,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:36,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:36,394 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash 941909210, now seen corresponding path program 1 times [2019-12-27 21:12:36,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:36,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571635384] [2019-12-27 21:12:36,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:36,451 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 21:12:36,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571635384] [2019-12-27 21:12:36,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:36,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:36,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356928731] [2019-12-27 21:12:36,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:36,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:36,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:12:36,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:36,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:36,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:36,464 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 21:12:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:36,676 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 21:12:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:12:36,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:12:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:36,691 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 21:12:36,691 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 21:12:36,692 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 21:12:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 21:12:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 21:12:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 21:12:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 21:12:36,744 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 21:12:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:36,744 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 21:12:36,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 21:12:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:36,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:36,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:36,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1601113905, now seen corresponding path program 1 times [2019-12-27 21:12:36,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:36,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302070335] [2019-12-27 21:12:36,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:36,882 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 21:12:36,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302070335] [2019-12-27 21:12:36,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:36,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:36,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206771168] [2019-12-27 21:12:36,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:36,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:36,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:36,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:36,897 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:36,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:36,898 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 21:12:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:37,170 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 21:12:37,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:37,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:12:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:37,195 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 21:12:37,200 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 21:12:37,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 21:12:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 21:12:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 21:12:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 21:12:37,254 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 21:12:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:37,254 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 21:12:37,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 21:12:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:12:37,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:37,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:37,258 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:37,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 16465726, now seen corresponding path program 1 times [2019-12-27 21:12:37,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:37,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469605555] [2019-12-27 21:12:37,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:37,296 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 21:12:37,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469605555] [2019-12-27 21:12:37,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:37,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:37,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [650387381] [2019-12-27 21:12:37,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:37,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:37,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:12:37,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:37,314 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:37,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:37,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:37,315 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 21:12:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:37,364 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 21:12:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:37,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 21:12:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:37,374 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 21:12:37,374 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 21:12:37,375 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 21:12:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 21:12:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 21:12:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 21:12:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 21:12:37,468 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 21:12:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:37,469 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 21:12:37,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 21:12:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:37,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:37,472 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 21:12:37,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1111732337, now seen corresponding path program 1 times [2019-12-27 21:12:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:37,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8553908] [2019-12-27 21:12:37,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:37,559 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 21:12:37,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8553908] [2019-12-27 21:12:37,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:37,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:37,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248344267] [2019-12-27 21:12:37,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:37,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:37,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:12:37,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:37,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:12:37,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:12:37,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:12:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:12:37,616 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 21:12:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:37,647 INFO L93 Difference]: Finished difference Result 3059 states and 6636 transitions. [2019-12-27 21:12:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:37,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 21:12:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:37,651 INFO L225 Difference]: With dead ends: 3059 [2019-12-27 21:12:37,651 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 21:12:37,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 21:12:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 21:12:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1385. [2019-12-27 21:12:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-12-27 21:12:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2946 transitions. [2019-12-27 21:12:37,686 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2946 transitions. Word has length 26 [2019-12-27 21:12:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:37,687 INFO L462 AbstractCegarLoop]: Abstraction has 1385 states and 2946 transitions. [2019-12-27 21:12:37,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:12:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2946 transitions. [2019-12-27 21:12:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:12:37,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:37,689 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 21:12:37,689 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash 858483252, now seen corresponding path program 1 times [2019-12-27 21:12:37,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:37,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457756190] [2019-12-27 21:12:37,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:37,771 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 21:12:37,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457756190] [2019-12-27 21:12:37,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:37,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:37,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334561247] [2019-12-27 21:12:37,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:37,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:37,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:12:37,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:37,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:37,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:37,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:37,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:37,786 INFO L87 Difference]: Start difference. First operand 1385 states and 2946 transitions. Second operand 5 states. [2019-12-27 21:12:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:37,924 INFO L93 Difference]: Finished difference Result 1390 states and 2937 transitions. [2019-12-27 21:12:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:37,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:12:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:37,928 INFO L225 Difference]: With dead ends: 1390 [2019-12-27 21:12:37,929 INFO L226 Difference]: Without dead ends: 1390 [2019-12-27 21:12:37,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-27 21:12:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1347. [2019-12-27 21:12:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-12-27 21:12:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2871 transitions. [2019-12-27 21:12:37,961 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2871 transitions. Word has length 26 [2019-12-27 21:12:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:37,961 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2871 transitions. [2019-12-27 21:12:37,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2871 transitions. [2019-12-27 21:12:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:12:37,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:37,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:37,964 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1256798795, now seen corresponding path program 1 times [2019-12-27 21:12:37,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:37,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900008445] [2019-12-27 21:12:37,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:38,032 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 21:12:38,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900008445] [2019-12-27 21:12:38,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:38,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:12:38,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762360917] [2019-12-27 21:12:38,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:38,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:38,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:12:38,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:38,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:12:38,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:38,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:38,124 INFO L87 Difference]: Start difference. First operand 1347 states and 2871 transitions. Second operand 8 states. [2019-12-27 21:12:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:38,909 INFO L93 Difference]: Finished difference Result 2150 states and 4509 transitions. [2019-12-27 21:12:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:12:38,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 21:12:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:38,915 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 21:12:38,915 INFO L226 Difference]: Without dead ends: 2150 [2019-12-27 21:12:38,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-12-27 21:12:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1941. [2019-12-27 21:12:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-12-27 21:12:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4107 transitions. [2019-12-27 21:12:38,971 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4107 transitions. Word has length 27 [2019-12-27 21:12:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:38,971 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 4107 transitions. [2019-12-27 21:12:38,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4107 transitions. [2019-12-27 21:12:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:12:38,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:38,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:38,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -374854062, now seen corresponding path program 1 times [2019-12-27 21:12:38,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:38,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631058795] [2019-12-27 21:12:38,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:39,038 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 21:12:39,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631058795] [2019-12-27 21:12:39,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:39,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:12:39,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487487726] [2019-12-27 21:12:39,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:39,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:39,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:12:39,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:39,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:12:39,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:39,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:39,079 INFO L87 Difference]: Start difference. First operand 1941 states and 4107 transitions. Second operand 5 states. [2019-12-27 21:12:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:39,098 INFO L93 Difference]: Finished difference Result 1087 states and 2170 transitions. [2019-12-27 21:12:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:12:39,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:12:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:39,101 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 21:12:39,101 INFO L226 Difference]: Without dead ends: 981 [2019-12-27 21:12:39,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:12:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-27 21:12:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 909. [2019-12-27 21:12:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 21:12:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1885 transitions. [2019-12-27 21:12:39,122 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1885 transitions. Word has length 28 [2019-12-27 21:12:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:39,123 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1885 transitions. [2019-12-27 21:12:39,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1885 transitions. [2019-12-27 21:12:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:39,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:39,127 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] [2019-12-27 21:12:39,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1671814948, now seen corresponding path program 1 times [2019-12-27 21:12:39,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:39,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968189794] [2019-12-27 21:12:39,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:39,275 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 21:12:39,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968189794] [2019-12-27 21:12:39,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:39,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:39,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137617777] [2019-12-27 21:12:39,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:39,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:39,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:12:39,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:39,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:39,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:12:39,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:39,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:12:39,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:39,421 INFO L87 Difference]: Start difference. First operand 909 states and 1885 transitions. Second operand 9 states. [2019-12-27 21:12:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:39,709 INFO L93 Difference]: Finished difference Result 1569 states and 3170 transitions. [2019-12-27 21:12:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:12:39,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:12:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:39,714 INFO L225 Difference]: With dead ends: 1569 [2019-12-27 21:12:39,714 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 21:12:39,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:12:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 21:12:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 907. [2019-12-27 21:12:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 21:12:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1857 transitions. [2019-12-27 21:12:39,736 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1857 transitions. Word has length 51 [2019-12-27 21:12:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:39,736 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1857 transitions. [2019-12-27 21:12:39,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:12:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1857 transitions. [2019-12-27 21:12:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:39,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:39,739 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] [2019-12-27 21:12:39,740 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1673779650, now seen corresponding path program 2 times [2019-12-27 21:12:39,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:39,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014016576] [2019-12-27 21:12:39,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:39,881 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 21:12:39,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014016576] [2019-12-27 21:12:39,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:39,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:39,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119194000] [2019-12-27 21:12:39,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:39,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:40,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 21:12:40,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:40,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:40,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:12:40,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:12:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:40,093 INFO L87 Difference]: Start difference. First operand 907 states and 1857 transitions. Second operand 7 states. [2019-12-27 21:12:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:40,655 INFO L93 Difference]: Finished difference Result 1063 states and 2153 transitions. [2019-12-27 21:12:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:40,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 21:12:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:40,660 INFO L225 Difference]: With dead ends: 1063 [2019-12-27 21:12:40,660 INFO L226 Difference]: Without dead ends: 1063 [2019-12-27 21:12:40,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-12-27 21:12:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 937. [2019-12-27 21:12:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 21:12:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1912 transitions. [2019-12-27 21:12:40,681 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1912 transitions. Word has length 51 [2019-12-27 21:12:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:40,682 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1912 transitions. [2019-12-27 21:12:40,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:12:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1912 transitions. [2019-12-27 21:12:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:40,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:40,684 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] [2019-12-27 21:12:40,685 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -251445194, now seen corresponding path program 3 times [2019-12-27 21:12:40,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373341323] [2019-12-27 21:12:40,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:40,760 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 21:12:40,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373341323] [2019-12-27 21:12:40,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:40,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:12:40,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548443643] [2019-12-27 21:12:40,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:40,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:40,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 129 transitions. [2019-12-27 21:12:40,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:40,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:12:40,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:40,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:40,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:40,824 INFO L87 Difference]: Start difference. First operand 937 states and 1912 transitions. Second operand 5 states. [2019-12-27 21:12:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:41,090 INFO L93 Difference]: Finished difference Result 1066 states and 2145 transitions. [2019-12-27 21:12:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:12:41,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 21:12:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:41,097 INFO L225 Difference]: With dead ends: 1066 [2019-12-27 21:12:41,097 INFO L226 Difference]: Without dead ends: 1066 [2019-12-27 21:12:41,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 21:12:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-27 21:12:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 978. [2019-12-27 21:12:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-12-27 21:12:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1992 transitions. [2019-12-27 21:12:41,119 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1992 transitions. Word has length 51 [2019-12-27 21:12:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:41,121 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 1992 transitions. [2019-12-27 21:12:41,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1992 transitions. [2019-12-27 21:12:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:41,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:41,123 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] [2019-12-27 21:12:41,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -665100994, now seen corresponding path program 4 times [2019-12-27 21:12:41,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:41,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451935895] [2019-12-27 21:12:41,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:41,249 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 21:12:41,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451935895] [2019-12-27 21:12:41,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:41,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:41,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601474583] [2019-12-27 21:12:41,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:41,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:41,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 127 transitions. [2019-12-27 21:12:41,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:41,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:12:41,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:12:41,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:12:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:12:41,369 INFO L87 Difference]: Start difference. First operand 978 states and 1992 transitions. Second operand 7 states. [2019-12-27 21:12:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:42,012 INFO L93 Difference]: Finished difference Result 1204 states and 2405 transitions. [2019-12-27 21:12:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:42,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 21:12:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:42,016 INFO L225 Difference]: With dead ends: 1204 [2019-12-27 21:12:42,016 INFO L226 Difference]: Without dead ends: 1204 [2019-12-27 21:12:42,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-27 21:12:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1038. [2019-12-27 21:12:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-12-27 21:12:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 2108 transitions. [2019-12-27 21:12:42,039 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 2108 transitions. Word has length 51 [2019-12-27 21:12:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:42,040 INFO L462 AbstractCegarLoop]: Abstraction has 1038 states and 2108 transitions. [2019-12-27 21:12:42,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:12:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 2108 transitions. [2019-12-27 21:12:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:42,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:42,043 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] [2019-12-27 21:12:42,043 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -535300024, now seen corresponding path program 5 times [2019-12-27 21:12:42,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:42,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633088606] [2019-12-27 21:12:42,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:12:42,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633088606] [2019-12-27 21:12:42,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:42,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:12:42,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1437677282] [2019-12-27 21:12:42,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:42,173 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:42,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 143 transitions. [2019-12-27 21:12:42,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:42,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:12:42,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:12:42,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:12:42,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:12:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:12:42,309 INFO L87 Difference]: Start difference. First operand 1038 states and 2108 transitions. Second operand 9 states. [2019-12-27 21:12:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:43,193 INFO L93 Difference]: Finished difference Result 2200 states and 4440 transitions. [2019-12-27 21:12:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:12:43,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:12:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:43,199 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 21:12:43,199 INFO L226 Difference]: Without dead ends: 2200 [2019-12-27 21:12:43,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:12:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-12-27 21:12:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1218. [2019-12-27 21:12:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-27 21:12:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 2521 transitions. [2019-12-27 21:12:43,232 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 2521 transitions. Word has length 51 [2019-12-27 21:12:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:43,233 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 2521 transitions. [2019-12-27 21:12:43,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:12:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 2521 transitions. [2019-12-27 21:12:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:12:43,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:43,236 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] [2019-12-27 21:12:43,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2015931556, now seen corresponding path program 6 times [2019-12-27 21:12:43,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:43,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024965604] [2019-12-27 21:12:43,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:43,338 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 21:12:43,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024965604] [2019-12-27 21:12:43,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:43,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:12:43,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988303038] [2019-12-27 21:12:43,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:43,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:43,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 125 transitions. [2019-12-27 21:12:43,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:43,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:12:43,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:12:43,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:12:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:12:43,416 INFO L87 Difference]: Start difference. First operand 1218 states and 2521 transitions. Second operand 6 states. [2019-12-27 21:12:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:43,625 INFO L93 Difference]: Finished difference Result 1410 states and 2861 transitions. [2019-12-27 21:12:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:12:43,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 21:12:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:43,629 INFO L225 Difference]: With dead ends: 1410 [2019-12-27 21:12:43,629 INFO L226 Difference]: Without dead ends: 1410 [2019-12-27 21:12:43,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-12-27 21:12:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1209. [2019-12-27 21:12:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-12-27 21:12:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 2503 transitions. [2019-12-27 21:12:43,652 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 2503 transitions. Word has length 51 [2019-12-27 21:12:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:43,653 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 2503 transitions. [2019-12-27 21:12:43,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:12:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 2503 transitions. [2019-12-27 21:12:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:43,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:43,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:43,656 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 187010410, now seen corresponding path program 1 times [2019-12-27 21:12:43,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:43,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135986972] [2019-12-27 21:12:43,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:43,765 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 21:12:43,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135986972] [2019-12-27 21:12:43,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:43,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:12:43,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471139115] [2019-12-27 21:12:43,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:43,787 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:43,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 194 transitions. [2019-12-27 21:12:43,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:43,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:12:43,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:12:43,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:12:43,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:12:43,984 INFO L87 Difference]: Start difference. First operand 1209 states and 2503 transitions. Second operand 8 states. [2019-12-27 21:12:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:44,605 INFO L93 Difference]: Finished difference Result 1641 states and 3324 transitions. [2019-12-27 21:12:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:12:44,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:12:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:44,611 INFO L225 Difference]: With dead ends: 1641 [2019-12-27 21:12:44,611 INFO L226 Difference]: Without dead ends: 1641 [2019-12-27 21:12:44,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:12:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-27 21:12:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1161. [2019-12-27 21:12:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 21:12:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2409 transitions. [2019-12-27 21:12:44,633 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2409 transitions. Word has length 52 [2019-12-27 21:12:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:44,633 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2409 transitions. [2019-12-27 21:12:44,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:12:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2409 transitions. [2019-12-27 21:12:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:44,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:44,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:44,636 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 114222535, now seen corresponding path program 1 times [2019-12-27 21:12:44,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380918907] [2019-12-27 21:12:44,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:44,734 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 21:12:44,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380918907] [2019-12-27 21:12:44,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:44,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:12:44,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545032076] [2019-12-27 21:12:44,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:44,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:44,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 130 transitions. [2019-12-27 21:12:44,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:44,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:12:44,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:12:44,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:12:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:12:44,810 INFO L87 Difference]: Start difference. First operand 1161 states and 2409 transitions. Second operand 5 states. [2019-12-27 21:12:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:44,888 INFO L93 Difference]: Finished difference Result 1428 states and 2949 transitions. [2019-12-27 21:12:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:44,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:12:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:44,893 INFO L225 Difference]: With dead ends: 1428 [2019-12-27 21:12:44,893 INFO L226 Difference]: Without dead ends: 1428 [2019-12-27 21:12:44,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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 21:12:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-27 21:12:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1230. [2019-12-27 21:12:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:12:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2559 transitions. [2019-12-27 21:12:44,923 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2559 transitions. Word has length 52 [2019-12-27 21:12:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:44,923 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2559 transitions. [2019-12-27 21:12:44,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:12:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2559 transitions. [2019-12-27 21:12:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:12:44,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:44,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:44,927 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:44,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1329705586, now seen corresponding path program 2 times [2019-12-27 21:12:44,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:44,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588676449] [2019-12-27 21:12:44,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:12:45,046 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 21:12:45,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588676449] [2019-12-27 21:12:45,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:12:45,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:12:45,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565637727] [2019-12-27 21:12:45,048 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:12:45,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:12:45,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 132 transitions. [2019-12-27 21:12:45,137 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:12:45,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:12:45,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:12:45,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:12:45,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:12:45,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:12:45,139 INFO L87 Difference]: Start difference. First operand 1230 states and 2559 transitions. Second operand 3 states. [2019-12-27 21:12:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:12:45,157 INFO L93 Difference]: Finished difference Result 1230 states and 2558 transitions. [2019-12-27 21:12:45,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:12:45,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:12:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:12:45,161 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 21:12:45,161 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 21:12:45,161 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 21:12:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 21:12:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 902. [2019-12-27 21:12:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-27 21:12:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1906 transitions. [2019-12-27 21:12:45,182 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1906 transitions. Word has length 52 [2019-12-27 21:12:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:12:45,182 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1906 transitions. [2019-12-27 21:12:45,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:12:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1906 transitions. [2019-12-27 21:12:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:12:45,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:12:45,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:12:45,185 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:12:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:12:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash 821444371, now seen corresponding path program 1 times [2019-12-27 21:12:45,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:12:45,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436295070] [2019-12-27 21:12:45,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:12:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:12:45,298 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:12:45,298 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:12:45,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_15) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_22|)) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_24 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~z$r_buff1_thd2~0_49) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1097~0.base_22|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1097~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1097~0.base_22|) |v_ULTIMATE.start_main_~#t1097~0.offset_17| 0))) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= |v_ULTIMATE.start_main_~#t1097~0.offset_17| 0) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1097~0.base_22| 4)) (= 0 v_~z$mem_tmp~0_9) (= 0 v_~z$r_buff1_thd1~0_20) (= (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_22| 1) |v_#valid_47|) (< 0 |v_#StackHeapBarrier_14|) (= v_~x~0_18 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd0~0_27) (= v_~z$r_buff0_thd2~0_78 0) (= 0 v_~z$w_buff1_used~0_65) (= v_~z$r_buff0_thd1~0_28 0) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_23, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, #length=|v_#length_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_22|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_17|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-12-27 21:12:45,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 21:12:45,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~z$r_buff1_thd2~0_Out-2057607268 ~z$r_buff0_thd2~0_In-2057607268) (= ~x~0_Out-2057607268 1) (= ~z$r_buff0_thd1~0_Out-2057607268 1) (= ~z$r_buff0_thd1~0_In-2057607268 ~z$r_buff1_thd1~0_Out-2057607268) (= ~z$r_buff0_thd0~0_In-2057607268 ~z$r_buff1_thd0~0_Out-2057607268) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2057607268))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2057607268, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2057607268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2057607268, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2057607268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2057607268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2057607268, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-2057607268, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-2057607268, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2057607268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2057607268, ~x~0=~x~0_Out-2057607268, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2057607268} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:12:45,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1979299055 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1979299055 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1979299055| ~z$w_buff0_used~0_In1979299055) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1979299055| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1979299055, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1979299055} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1979299055|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1979299055, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1979299055} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:12:45,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2121171470 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In2121171470 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2121171470 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In2121171470 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2121171470 |P0Thread1of1ForFork0_#t~ite6_Out2121171470|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out2121171470| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121171470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121171470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121171470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121171470} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2121171470|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121171470, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121171470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121171470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121171470} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:12:45,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-279692238 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-279692238 256)))) (or (and (= ~z$r_buff0_thd1~0_In-279692238 ~z$r_buff0_thd1~0_Out-279692238) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out-279692238) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-279692238, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-279692238} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-279692238, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-279692238|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-279692238} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:12:45,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-668425622 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-668425622 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-668425622 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-668425622 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-668425622| ~z$r_buff1_thd1~0_In-668425622) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-668425622| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-668425622, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-668425622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668425622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-668425622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-668425622, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-668425622|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-668425622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-668425622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-668425622} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:12:45,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_16)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:12:45,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd2~0_53 v_~z$r_buff0_thd2~0_52)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_53} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:12:45,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L773-->L773-8: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out330238753| |P1Thread1of1ForFork1_#t~ite29_Out330238753|)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In330238753 256))) (.cse5 (= (mod ~z$r_buff1_thd2~0_In330238753 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In330238753 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In330238753 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In330238753 256)))) (or (and (or (and (= ~z$r_buff1_thd2~0_In330238753 |P1Thread1of1ForFork1_#t~ite30_Out330238753|) (= |P1Thread1of1ForFork1_#t~ite29_In330238753| |P1Thread1of1ForFork1_#t~ite29_Out330238753|) (not .cse0)) (and .cse1 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)) (= ~z$r_buff1_thd2~0_In330238753 |P1Thread1of1ForFork1_#t~ite29_Out330238753|) .cse0)) (= |P1Thread1of1ForFork1_#t~ite28_In330238753| |P1Thread1of1ForFork1_#t~ite28_Out330238753|)) (let ((.cse6 (not .cse3))) (and .cse1 (not .cse4) (= |P1Thread1of1ForFork1_#t~ite28_Out330238753| |P1Thread1of1ForFork1_#t~ite29_Out330238753|) (or .cse6 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite28_Out330238753| 0) (or .cse6 (not .cse2)) .cse0)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In330238753|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In330238753, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In330238753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In330238753, ~weak$$choice2~0=~weak$$choice2~0_In330238753, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In330238753, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In330238753|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out330238753|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out330238753|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In330238753, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In330238753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In330238753, ~weak$$choice2~0=~weak$$choice2~0_In330238753, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In330238753, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out330238753|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:12:45,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:12:45,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1636246139 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1636246139 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1636246139 |P1Thread1of1ForFork1_#t~ite32_Out1636246139|) (not .cse1)) (and (= ~z~0_In1636246139 |P1Thread1of1ForFork1_#t~ite32_Out1636246139|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1636246139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1636246139, ~z$w_buff1~0=~z$w_buff1~0_In1636246139, ~z~0=~z~0_In1636246139} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1636246139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1636246139, ~z$w_buff1~0=~z$w_buff1~0_In1636246139, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1636246139|, ~z~0=~z~0_In1636246139} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:12:45,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 21:12:45,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In440704100 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In440704100 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out440704100|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In440704100 |P1Thread1of1ForFork1_#t~ite34_Out440704100|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In440704100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In440704100} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In440704100, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out440704100|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In440704100} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:12:45,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1237437074 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1237437074 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1237437074 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1237437074 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1237437074|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1237437074 |P1Thread1of1ForFork1_#t~ite35_Out-1237437074|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237437074, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1237437074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237437074, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1237437074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237437074, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1237437074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237437074, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1237437074|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1237437074} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:12:45,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1101266065 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1101266065 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In1101266065 |P1Thread1of1ForFork1_#t~ite36_Out1101266065|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1101266065|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1101266065, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1101266065} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1101266065, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1101266065, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1101266065|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:12:45,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-234082326 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-234082326 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-234082326 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-234082326 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-234082326 |P1Thread1of1ForFork1_#t~ite37_Out-234082326|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-234082326|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-234082326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-234082326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-234082326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-234082326} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-234082326, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-234082326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-234082326, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-234082326, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-234082326|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:45,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:12:45,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 21:12:45,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out-821596924| |ULTIMATE.start_main_#t~ite40_Out-821596924|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-821596924 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-821596924 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-821596924 |ULTIMATE.start_main_#t~ite40_Out-821596924|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-821596924 |ULTIMATE.start_main_#t~ite40_Out-821596924|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-821596924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-821596924, ~z$w_buff1~0=~z$w_buff1~0_In-821596924, ~z~0=~z~0_In-821596924} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-821596924|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-821596924|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-821596924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-821596924, ~z$w_buff1~0=~z$w_buff1~0_In-821596924, ~z~0=~z~0_In-821596924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:12:45,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-369142651 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-369142651 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-369142651| ~z$w_buff0_used~0_In-369142651) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-369142651| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369142651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369142651} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-369142651, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-369142651, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-369142651|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:12:45,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1109611452 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1109611452 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1109611452 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1109611452 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1109611452 |ULTIMATE.start_main_#t~ite43_Out1109611452|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1109611452|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1109611452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1109611452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1109611452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1109611452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1109611452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1109611452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1109611452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1109611452, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1109611452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:12:45,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1858952602 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1858952602 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1858952602| ~z$r_buff0_thd0~0_In-1858952602) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1858952602| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858952602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858952602} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858952602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858952602, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1858952602|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:12:45,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1830826416 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1830826416 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1830826416 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1830826416 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1830826416|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1830826416 |ULTIMATE.start_main_#t~ite45_Out1830826416|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1830826416, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1830826416, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1830826416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830826416} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1830826416, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1830826416, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1830826416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830826416, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1830826416|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:12:45,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_19) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:12:45,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:12:45 BasicIcfg [2019-12-27 21:12:45,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:12:45,416 INFO L168 Benchmark]: Toolchain (without parser) took 16712.95 ms. Allocated memory was 136.8 MB in the beginning and 564.1 MB in the end (delta: 427.3 MB). Free memory was 99.8 MB in the beginning and 32.7 MB in the end (delta: 67.2 MB). Peak memory consumption was 494.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,417 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:12:45,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.45 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 155.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.83 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,422 INFO L168 Benchmark]: Boogie Preprocessor took 48.43 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,425 INFO L168 Benchmark]: RCFGBuilder took 778.18 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 105.2 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,426 INFO L168 Benchmark]: TraceAbstraction took 15118.38 ms. Allocated memory was 200.8 MB in the beginning and 564.1 MB in the end (delta: 363.3 MB). Free memory was 105.2 MB in the beginning and 32.7 MB in the end (delta: 72.5 MB). Peak memory consumption was 435.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:12:45,434 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.21 ms. Allocated memory is still 136.8 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 690.45 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 155.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.83 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.43 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 778.18 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 105.2 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15118.38 ms. Allocated memory was 200.8 MB in the beginning and 564.1 MB in the end (delta: 363.3 MB). Free memory was 105.2 MB in the beginning and 32.7 MB in the end (delta: 72.5 MB). Peak memory consumption was 435.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 4431 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49804 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2660 SDtfs, 2127 SDslu, 6015 SDs, 0 SdLazy, 3840 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 34 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 4846 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 86335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...