/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:53:48,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:53:48,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:53:48,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:53:48,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:53:48,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:53:48,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:53:48,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:53:48,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:53:48,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:53:48,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:53:48,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:53:48,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:53:48,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:53:48,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:53:48,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:53:48,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:53:48,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:53:48,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:53:48,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:53:48,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:53:48,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:53:48,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:53:48,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:53:48,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:53:48,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:53:48,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:53:48,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:53:48,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:53:48,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:53:48,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:53:48,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:53:48,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:53:48,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:53:48,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:53:48,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:53:48,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:53:48,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:53:48,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:53:48,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:53:48,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:53:48,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:53:48,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:53:48,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:53:48,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:53:48,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:53:48,568 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:53:48,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:53:48,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:53:48,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:53:48,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:53:48,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:53:48,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:53:48,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:53:48,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:53:48,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:53:48,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:53:48,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:53:48,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:53:48,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:53:48,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:53:48,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:53:48,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:53:48,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:53:48,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:53:48,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:53:48,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:53:48,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:53:48,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:53:48,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:53:48,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:53:48,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:53:48,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:53:48,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:53:48,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:53:48,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:53:48,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:53:48,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-27 06:53:48,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7b1829/c88288f9120c44b1b2a125705de21a25/FLAG295b35453 [2019-12-27 06:53:49,471 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:53:49,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-27 06:53:49,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7b1829/c88288f9120c44b1b2a125705de21a25/FLAG295b35453 [2019-12-27 06:53:49,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd7b1829/c88288f9120c44b1b2a125705de21a25 [2019-12-27 06:53:49,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:53:49,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:53:49,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:53:49,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:53:49,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:53:49,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:53:49" (1/1) ... [2019-12-27 06:53:49,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:49, skipping insertion in model container [2019-12-27 06:53:49,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:53:49" (1/1) ... [2019-12-27 06:53:49,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:53:49,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:53:50,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:53:50,373 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:53:50,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:53:50,522 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:53:50,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50 WrapperNode [2019-12-27 06:53:50,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:53:50,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:53:50,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:53:50,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:53:50,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:53:50,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:53:50,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:53:50,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:53:50,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (1/1) ... [2019-12-27 06:53:50,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:53:50,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:53:50,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:53:50,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:53:50,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (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 06:53:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:53:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:53:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:53:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:53:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:53:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:53:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:53:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:53:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:53:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:53:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:53:50,720 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 06:53:51,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:53:51,456 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:53:51,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:53:51 BoogieIcfgContainer [2019-12-27 06:53:51,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:53:51,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:53:51,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:53:51,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:53:51,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:53:49" (1/3) ... [2019-12-27 06:53:51,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d6ed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:53:51, skipping insertion in model container [2019-12-27 06:53:51,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:50" (2/3) ... [2019-12-27 06:53:51,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d6ed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:53:51, skipping insertion in model container [2019-12-27 06:53:51,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:53:51" (3/3) ... [2019-12-27 06:53:51,470 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-12-27 06:53:51,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:53:51,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:53:51,497 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:53:51,498 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:53:51,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:51,662 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:53:51,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:53:51,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:53:51,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:53:51,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:53:51,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:53:51,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:53:51,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:53:51,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:53:51,700 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 06:53:51,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:53:51,817 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:53:51,818 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:53:51,832 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:53:51,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:53:51,894 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:53:51,894 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:53:51,900 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:53:51,914 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:53:51,916 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:53:55,102 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 06:53:55,208 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 06:53:55,228 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-27 06:53:55,229 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 06:53:55,232 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-27 06:53:55,722 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-27 06:53:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-27 06:53:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:53:55,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:55,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:53:55,731 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-27 06:53:55,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:55,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234532430] [2019-12-27 06:53:55,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:55,964 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 06:53:55,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234532430] [2019-12-27 06:53:55,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:55,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:53:55,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604076319] [2019-12-27 06:53:55,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:55,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:55,997 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-27 06:53:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:56,304 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-27 06:53:56,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:56,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:53:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:56,404 INFO L225 Difference]: With dead ends: 8310 [2019-12-27 06:53:56,404 INFO L226 Difference]: Without dead ends: 7790 [2019-12-27 06:53:56,406 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 06:53:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-27 06:53:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-27 06:53:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-27 06:53:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-27 06:53:56,888 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-27 06:53:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:56,888 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-27 06:53:56,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-27 06:53:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:53:56,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:56,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:56,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-27 06:53:56,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:56,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33571680] [2019-12-27 06:53:56,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:57,054 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 06:53:57,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33571680] [2019-12-27 06:53:57,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:57,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:57,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296701321] [2019-12-27 06:53:57,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:53:57,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:53:57,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:53:57,058 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-27 06:53:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:57,537 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-27 06:53:57,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:53:57,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:53:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:57,614 INFO L225 Difference]: With dead ends: 12240 [2019-12-27 06:53:57,614 INFO L226 Difference]: Without dead ends: 12233 [2019-12-27 06:53:57,615 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 06:53:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-27 06:53:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-27 06:53:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-27 06:53:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-27 06:53:58,695 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-27 06:53:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:58,695 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-27 06:53:58,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:53:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-27 06:53:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:53:58,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:58,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:58,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-27 06:53:58,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:58,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390732546] [2019-12-27 06:53:58,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:58,841 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 06:53:58,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390732546] [2019-12-27 06:53:58,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:58,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:53:58,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480081939] [2019-12-27 06:53:58,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:53:58,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:53:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:58,843 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-27 06:53:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:59,233 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-27 06:53:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:53:59,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 06:53:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:59,298 INFO L225 Difference]: With dead ends: 15483 [2019-12-27 06:53:59,299 INFO L226 Difference]: Without dead ends: 15483 [2019-12-27 06:53:59,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:53:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-27 06:53:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-27 06:53:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-27 06:53:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-27 06:53:59,933 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-27 06:53:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:59,937 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-27 06:53:59,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:53:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-27 06:53:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:53:59,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:59,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:59,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-27 06:53:59,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:59,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738969910] [2019-12-27 06:53:59,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:00,054 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 06:54:00,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738969910] [2019-12-27 06:54:00,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:00,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:00,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129940388] [2019-12-27 06:54:00,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:00,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:00,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:00,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:00,057 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-27 06:54:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,136 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-27 06:54:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:00,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:54:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,171 INFO L225 Difference]: With dead ends: 12387 [2019-12-27 06:54:00,171 INFO L226 Difference]: Without dead ends: 12387 [2019-12-27 06:54:00,171 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 06:54:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-27 06:54:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-27 06:54:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-27 06:54:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-27 06:54:00,731 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-27 06:54:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-27 06:54:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-27 06:54:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:54:00,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:00,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:00,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-27 06:54:00,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:00,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72043211] [2019-12-27 06:54:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:00,777 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 06:54:00,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72043211] [2019-12-27 06:54:00,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:00,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:00,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926108431] [2019-12-27 06:54:00,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:00,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:00,780 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 3 states. [2019-12-27 06:54:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,891 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-27 06:54:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:00,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 06:54:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,926 INFO L225 Difference]: With dead ends: 20943 [2019-12-27 06:54:00,926 INFO L226 Difference]: Without dead ends: 11612 [2019-12-27 06:54:00,927 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 06:54:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-27 06:54:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-27 06:54:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-27 06:54:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-27 06:54:01,265 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-27 06:54:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:01,266 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-27 06:54:01,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-27 06:54:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:54:01,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:01,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:01,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:01,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-27 06:54:01,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:01,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314555676] [2019-12-27 06:54:01,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:01,362 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 06:54:01,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314555676] [2019-12-27 06:54:01,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:01,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:01,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899216312] [2019-12-27 06:54:01,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:01,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:01,364 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 4 states. [2019-12-27 06:54:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:01,399 INFO L93 Difference]: Finished difference Result 1835 states and 4564 transitions. [2019-12-27 06:54:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:01,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 06:54:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:01,565 INFO L225 Difference]: With dead ends: 1835 [2019-12-27 06:54:01,565 INFO L226 Difference]: Without dead ends: 1299 [2019-12-27 06:54:01,565 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 06:54:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-12-27 06:54:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1295. [2019-12-27 06:54:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-27 06:54:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2878 transitions. [2019-12-27 06:54:01,592 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2878 transitions. Word has length 17 [2019-12-27 06:54:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:01,592 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2878 transitions. [2019-12-27 06:54:01,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2878 transitions. [2019-12-27 06:54:01,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:54:01,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:01,596 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 06:54:01,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-27 06:54:01,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028298548] [2019-12-27 06:54:01,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:01,744 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 06:54:01,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028298548] [2019-12-27 06:54:01,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:01,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:01,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862913395] [2019-12-27 06:54:01,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:01,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:01,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:01,747 INFO L87 Difference]: Start difference. First operand 1295 states and 2878 transitions. Second operand 6 states. [2019-12-27 06:54:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:01,997 INFO L93 Difference]: Finished difference Result 1351 states and 2946 transitions. [2019-12-27 06:54:01,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:54:01,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:54:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:02,000 INFO L225 Difference]: With dead ends: 1351 [2019-12-27 06:54:02,000 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 06:54:02,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:54:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 06:54:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1253. [2019-12-27 06:54:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-12-27 06:54:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2773 transitions. [2019-12-27 06:54:02,024 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2773 transitions. Word has length 25 [2019-12-27 06:54:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:02,024 INFO L462 AbstractCegarLoop]: Abstraction has 1253 states and 2773 transitions. [2019-12-27 06:54:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2773 transitions. [2019-12-27 06:54:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:54:02,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:02,027 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 06:54:02,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1615008956, now seen corresponding path program 1 times [2019-12-27 06:54:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115265851] [2019-12-27 06:54:02,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:02,118 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 06:54:02,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115265851] [2019-12-27 06:54:02,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:02,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:02,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152332155] [2019-12-27 06:54:02,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:02,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:02,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:02,121 INFO L87 Difference]: Start difference. First operand 1253 states and 2773 transitions. Second operand 5 states. [2019-12-27 06:54:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:02,588 INFO L93 Difference]: Finished difference Result 1954 states and 4236 transitions. [2019-12-27 06:54:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:02,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:54:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:02,593 INFO L225 Difference]: With dead ends: 1954 [2019-12-27 06:54:02,593 INFO L226 Difference]: Without dead ends: 1954 [2019-12-27 06:54:02,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-12-27 06:54:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1770. [2019-12-27 06:54:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2019-12-27 06:54:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 3881 transitions. [2019-12-27 06:54:02,638 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 3881 transitions. Word has length 27 [2019-12-27 06:54:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:02,639 INFO L462 AbstractCegarLoop]: Abstraction has 1770 states and 3881 transitions. [2019-12-27 06:54:02,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3881 transitions. [2019-12-27 06:54:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:54:02,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:02,650 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 06:54:02,651 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-27 06:54:02,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:02,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064387451] [2019-12-27 06:54:02,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:02,751 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 06:54:02,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064387451] [2019-12-27 06:54:02,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:02,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:02,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451028949] [2019-12-27 06:54:02,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:02,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:02,754 INFO L87 Difference]: Start difference. First operand 1770 states and 3881 transitions. Second operand 5 states. [2019-12-27 06:54:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:02,800 INFO L93 Difference]: Finished difference Result 1084 states and 2256 transitions. [2019-12-27 06:54:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:02,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:54:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:02,804 INFO L225 Difference]: With dead ends: 1084 [2019-12-27 06:54:02,805 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 06:54:02,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 06:54:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 850. [2019-12-27 06:54:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-27 06:54:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1827 transitions. [2019-12-27 06:54:02,822 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1827 transitions. Word has length 28 [2019-12-27 06:54:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:02,822 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1827 transitions. [2019-12-27 06:54:02,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1827 transitions. [2019-12-27 06:54:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:54:02,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:02,828 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 06:54:02,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:02,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1467449375, now seen corresponding path program 1 times [2019-12-27 06:54:02,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:02,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183385620] [2019-12-27 06:54:02,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:02,885 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 06:54:02,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183385620] [2019-12-27 06:54:02,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:02,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:02,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592317182] [2019-12-27 06:54:02,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:02,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:02,888 INFO L87 Difference]: Start difference. First operand 850 states and 1827 transitions. Second operand 3 states. [2019-12-27 06:54:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:02,931 INFO L93 Difference]: Finished difference Result 1251 states and 2618 transitions. [2019-12-27 06:54:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:02,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:54:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:02,934 INFO L225 Difference]: With dead ends: 1251 [2019-12-27 06:54:02,934 INFO L226 Difference]: Without dead ends: 1251 [2019-12-27 06:54:02,934 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 06:54:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-27 06:54:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 929. [2019-12-27 06:54:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-12-27 06:54:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1984 transitions. [2019-12-27 06:54:02,954 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1984 transitions. Word has length 51 [2019-12-27 06:54:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:02,954 INFO L462 AbstractCegarLoop]: Abstraction has 929 states and 1984 transitions. [2019-12-27 06:54:02,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1984 transitions. [2019-12-27 06:54:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:54:02,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:02,958 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 06:54:02,959 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1315298730, now seen corresponding path program 1 times [2019-12-27 06:54:02,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:02,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44720592] [2019-12-27 06:54:02,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:03,093 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 06:54:03,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44720592] [2019-12-27 06:54:03,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:03,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:03,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519551792] [2019-12-27 06:54:03,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:03,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:03,097 INFO L87 Difference]: Start difference. First operand 929 states and 1984 transitions. Second operand 7 states. [2019-12-27 06:54:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:03,284 INFO L93 Difference]: Finished difference Result 1587 states and 3308 transitions. [2019-12-27 06:54:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:54:03,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:54:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:03,286 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 06:54:03,287 INFO L226 Difference]: Without dead ends: 1057 [2019-12-27 06:54:03,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-27 06:54:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 928. [2019-12-27 06:54:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-27 06:54:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1962 transitions. [2019-12-27 06:54:03,302 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1962 transitions. Word has length 51 [2019-12-27 06:54:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:03,303 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1962 transitions. [2019-12-27 06:54:03,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1962 transitions. [2019-12-27 06:54:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:54:03,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:03,306 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 06:54:03,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 619071112, now seen corresponding path program 2 times [2019-12-27 06:54:03,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:03,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530644259] [2019-12-27 06:54:03,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:03,369 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 06:54:03,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530644259] [2019-12-27 06:54:03,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:03,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:03,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891817892] [2019-12-27 06:54:03,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:03,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:03,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:03,372 INFO L87 Difference]: Start difference. First operand 928 states and 1962 transitions. Second operand 3 states. [2019-12-27 06:54:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:03,429 INFO L93 Difference]: Finished difference Result 1163 states and 2443 transitions. [2019-12-27 06:54:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:03,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:54:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:03,431 INFO L225 Difference]: With dead ends: 1163 [2019-12-27 06:54:03,432 INFO L226 Difference]: Without dead ends: 1163 [2019-12-27 06:54:03,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 06:54:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-12-27 06:54:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 941. [2019-12-27 06:54:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-27 06:54:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2004 transitions. [2019-12-27 06:54:03,448 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2004 transitions. Word has length 51 [2019-12-27 06:54:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:03,449 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 2004 transitions. [2019-12-27 06:54:03,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2004 transitions. [2019-12-27 06:54:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:03,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:03,452 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 06:54:03,452 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 471151996, now seen corresponding path program 1 times [2019-12-27 06:54:03,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:03,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761459476] [2019-12-27 06:54:03,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:03,782 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 06:54:03,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761459476] [2019-12-27 06:54:03,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:03,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:54:03,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061406792] [2019-12-27 06:54:03,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:54:03,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:54:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:54:03,786 INFO L87 Difference]: Start difference. First operand 941 states and 2004 transitions. Second operand 8 states. [2019-12-27 06:54:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:04,676 INFO L93 Difference]: Finished difference Result 1331 states and 2743 transitions. [2019-12-27 06:54:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:54:04,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 06:54:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:04,679 INFO L225 Difference]: With dead ends: 1331 [2019-12-27 06:54:04,679 INFO L226 Difference]: Without dead ends: 1331 [2019-12-27 06:54:04,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:54:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-12-27 06:54:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1043. [2019-12-27 06:54:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 06:54:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2197 transitions. [2019-12-27 06:54:04,697 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2197 transitions. Word has length 52 [2019-12-27 06:54:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:04,697 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2197 transitions. [2019-12-27 06:54:04,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:54:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2197 transitions. [2019-12-27 06:54:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:04,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:04,701 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 06:54:04,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1785491348, now seen corresponding path program 2 times [2019-12-27 06:54:04,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:04,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547191052] [2019-12-27 06:54:04,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:04,769 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 06:54:04,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547191052] [2019-12-27 06:54:04,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:04,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:04,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109964325] [2019-12-27 06:54:04,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:04,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:04,772 INFO L87 Difference]: Start difference. First operand 1043 states and 2197 transitions. Second operand 3 states. [2019-12-27 06:54:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:04,787 INFO L93 Difference]: Finished difference Result 1043 states and 2196 transitions. [2019-12-27 06:54:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:04,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:04,789 INFO L225 Difference]: With dead ends: 1043 [2019-12-27 06:54:04,789 INFO L226 Difference]: Without dead ends: 1043 [2019-12-27 06:54:04,790 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 06:54:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-27 06:54:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 847. [2019-12-27 06:54:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-27 06:54:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1826 transitions. [2019-12-27 06:54:04,804 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1826 transitions. Word has length 52 [2019-12-27 06:54:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:04,804 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1826 transitions. [2019-12-27 06:54:04,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1826 transitions. [2019-12-27 06:54:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:04,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:04,807 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 06:54:04,808 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-27 06:54:04,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:04,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871239342] [2019-12-27 06:54:04,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:04,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:04,911 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:04,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1445~0.base_22|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1445~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1445~0.base_22|) |v_ULTIMATE.start_main_~#t1445~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~y$flush_delayed~0_13) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_22| 1)) (= v_~y$r_buff0_thd1~0_29 0) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (= |v_ULTIMATE.start_main_~#t1445~0.offset_17| 0) (= 0 |v_#NULL.base_3|) (= v_~y$mem_tmp~0_10 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1445~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_22|) 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ~y~0=v_~y~0_25, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:54:04,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-12-27 06:54:04,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= ~y$r_buff0_thd2~0_In-461861189 ~y$r_buff1_thd2~0_Out-461861189) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-461861189)) (= ~y$r_buff1_thd0~0_Out-461861189 ~y$r_buff0_thd0~0_In-461861189) (= 1 ~x~0_Out-461861189) (= ~y$r_buff0_thd1~0_In-461861189 ~y$r_buff1_thd1~0_Out-461861189) (= 1 ~y$r_buff0_thd1~0_Out-461861189)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-461861189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-461861189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-461861189, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-461861189} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-461861189, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-461861189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-461861189, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-461861189, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-461861189, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-461861189, ~x~0=~x~0_Out-461861189, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-461861189} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:54:04,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-288936215 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-288936215 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-288936215| ~y$w_buff0_used~0_In-288936215) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-288936215|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-288936215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-288936215} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-288936215|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288936215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-288936215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:54:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In467999410 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In467999410| |P1Thread1of1ForFork1_#t~ite14_Out467999410|) (= |P1Thread1of1ForFork1_#t~ite15_Out467999410| ~y$w_buff0~0_In467999410) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out467999410| |P1Thread1of1ForFork1_#t~ite14_Out467999410|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In467999410 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In467999410 256))) (= (mod ~y$w_buff0_used~0_In467999410 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In467999410 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out467999410| ~y$w_buff0~0_In467999410)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In467999410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In467999410, ~y$w_buff0~0=~y$w_buff0~0_In467999410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In467999410, ~weak$$choice2~0=~weak$$choice2~0_In467999410, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In467999410|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467999410} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In467999410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In467999410, ~y$w_buff0~0=~y$w_buff0~0_In467999410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In467999410, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out467999410|, ~weak$$choice2~0=~weak$$choice2~0_In467999410, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out467999410|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In467999410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:54:04,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In445764552 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In445764552 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In445764552 256) 0)) (= (mod ~y$w_buff0_used~0_In445764552 256) 0) (and (= (mod ~y$w_buff1_used~0_In445764552 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out445764552| ~y$w_buff0_used~0_In445764552) (= |P1Thread1of1ForFork1_#t~ite20_Out445764552| |P1Thread1of1ForFork1_#t~ite21_Out445764552|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In445764552| |P1Thread1of1ForFork1_#t~ite20_Out445764552|) (not .cse0) (= ~y$w_buff0_used~0_In445764552 |P1Thread1of1ForFork1_#t~ite21_Out445764552|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In445764552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445764552, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In445764552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In445764552, ~weak$$choice2~0=~weak$$choice2~0_In445764552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In445764552} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In445764552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445764552, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out445764552|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In445764552, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out445764552|, ~weak$$choice2~0=~weak$$choice2~0_In445764552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In445764552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:54:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:54:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1229180379 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1229180379 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1229180379 256))) (= (mod ~y$w_buff0_used~0_In1229180379 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In1229180379 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite29_Out1229180379| |P1Thread1of1ForFork1_#t~ite30_Out1229180379|) (= |P1Thread1of1ForFork1_#t~ite29_Out1229180379| ~y$r_buff1_thd2~0_In1229180379) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In1229180379| |P1Thread1of1ForFork1_#t~ite29_Out1229180379|) (= ~y$r_buff1_thd2~0_In1229180379 |P1Thread1of1ForFork1_#t~ite30_Out1229180379|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1229180379, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1229180379|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229180379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1229180379, ~weak$$choice2~0=~weak$$choice2~0_In1229180379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1229180379} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1229180379, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1229180379|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1229180379|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229180379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1229180379, ~weak$$choice2~0=~weak$$choice2~0_In1229180379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1229180379} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 06:54:04,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 06:54:04,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In970775526 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In970775526 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out970775526| |P1Thread1of1ForFork1_#t~ite32_Out970775526|))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out970775526| ~y~0_In970775526) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out970775526| ~y$w_buff1~0_In970775526)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In970775526, ~y$w_buff1~0=~y$w_buff1~0_In970775526, ~y~0=~y~0_In970775526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In970775526} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In970775526, ~y$w_buff1~0=~y$w_buff1~0_In970775526, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out970775526|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out970775526|, ~y~0=~y~0_In970775526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In970775526} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:54:04,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2003104796 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2003104796 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out2003104796| ~y$w_buff0_used~0_In2003104796)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out2003104796| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003104796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003104796, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2003104796|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:54:04,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-622459172 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-622459172 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-622459172 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-622459172 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-622459172|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-622459172 |P1Thread1of1ForFork1_#t~ite35_Out-622459172|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-622459172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-622459172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-622459172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622459172} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-622459172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-622459172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-622459172, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-622459172|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-622459172} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:54:04,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1992061363 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1992061363 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1992061363| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1992061363| ~y$r_buff0_thd2~0_In-1992061363) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1992061363, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1992061363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1992061363, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1992061363, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1992061363|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:54:04,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-692462134 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-692462134 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-692462134 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-692462134 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-692462134| ~y$r_buff1_thd2~0_In-692462134) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-692462134| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-692462134|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:54:04,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:54:04,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1591954590 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1591954590 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1591954590 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1591954590 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1591954590|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1591954590 |P0Thread1of1ForFork0_#t~ite6_Out1591954590|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591954590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1591954590|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1591954590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:54:04,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1218368053 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1218368053 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1218368053)) (and (= ~y$r_buff0_thd1~0_In-1218368053 ~y$r_buff0_thd1~0_Out-1218368053) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1218368053, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1218368053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1218368053, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1218368053|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1218368053} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:54:04,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In382267170 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In382267170 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In382267170 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In382267170 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out382267170|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In382267170 |P0Thread1of1ForFork0_#t~ite8_Out382267170|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In382267170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In382267170, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In382267170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In382267170} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In382267170, ~y$w_buff0_used~0=~y$w_buff0_used~0_In382267170, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out382267170|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In382267170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In382267170} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:54:04,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:54:04,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:54:04,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1727660151| |ULTIMATE.start_main_#t~ite40_Out-1727660151|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1727660151 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1727660151 256) 0))) (or (and (= ~y~0_In-1727660151 |ULTIMATE.start_main_#t~ite40_Out-1727660151|) (or .cse0 .cse1) .cse2) (and .cse2 (= |ULTIMATE.start_main_#t~ite40_Out-1727660151| ~y$w_buff1~0_In-1727660151) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1727660151, ~y~0=~y~0_In-1727660151, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1727660151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1727660151} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1727660151|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1727660151|, ~y$w_buff1~0=~y$w_buff1~0_In-1727660151, ~y~0=~y~0_In-1727660151, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1727660151, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1727660151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:54:04,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1714968535 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1714968535 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1714968535| ~y$w_buff0_used~0_In1714968535) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out1714968535| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1714968535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1714968535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1714968535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1714968535, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1714968535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:54:04,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1610782569 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1610782569 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1610782569 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1610782569 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1610782569 |ULTIMATE.start_main_#t~ite43_Out-1610782569|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1610782569|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1610782569, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1610782569, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1610782569|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:54:04,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-257883489 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-257883489 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-257883489| ~y$r_buff0_thd0~0_In-257883489) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-257883489| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-257883489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-257883489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-257883489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-257883489, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-257883489|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:54:04,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2004607668 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2004607668 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2004607668 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-2004607668 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2004607668| ~y$r_buff1_thd0~0_In-2004607668)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2004607668|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2004607668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2004607668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2004607668} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2004607668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2004607668, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2004607668|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2004607668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:54:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:05,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:05 BasicIcfg [2019-12-27 06:54:05,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:05,018 INFO L168 Benchmark]: Toolchain (without parser) took 15242.09 ms. Allocated memory was 144.7 MB in the beginning and 627.6 MB in the end (delta: 482.9 MB). Free memory was 101.1 MB in the beginning and 211.2 MB in the end (delta: -110.0 MB). Peak memory consumption was 372.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,019 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.77 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.86 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,024 INFO L168 Benchmark]: Boogie Preprocessor took 48.43 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,025 INFO L168 Benchmark]: RCFGBuilder took 827.05 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 105.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,028 INFO L168 Benchmark]: TraceAbstraction took 13553.62 ms. Allocated memory was 202.4 MB in the beginning and 627.6 MB in the end (delta: 425.2 MB). Free memory was 105.1 MB in the beginning and 211.2 MB in the end (delta: -106.1 MB). Peak memory consumption was 319.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:05,035 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.77 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.86 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.43 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.05 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 105.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13553.62 ms. Allocated memory was 202.4 MB in the beginning and 627.6 MB in the end (delta: 425.2 MB). Free memory was 105.1 MB in the beginning and 211.2 MB in the end (delta: -106.1 MB). Peak memory consumption was 319.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1673 SDtfs, 1523 SDslu, 3082 SDs, 0 SdLazy, 1944 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 6429 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 43219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...