/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/rfi000_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:58:54,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:58:54,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:58:54,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:58:54,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:58:54,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:58:54,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:58:54,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:58:54,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:58:54,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:58:54,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:58:54,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:58:54,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:58:54,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:58:54,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:58:54,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:58:54,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:58:54,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:58:54,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:58:54,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:58:54,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:58:54,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:58:54,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:58:54,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:58:54,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:58:54,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:58:54,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:58:54,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:58:54,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:58:54,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:58:54,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:58:54,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:58:54,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:58:54,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:58:54,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:58:54,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:58:54,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:58:54,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:58:54,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:58:54,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:58:54,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:58:54,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:58:54,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:58:54,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:58:54,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:58:54,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:58:54,473 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:58:54,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:58:54,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:58:54,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:58:54,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:58:54,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:58:54,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:58:54,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:58:54,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:58:54,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:58:54,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:58:54,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:58:54,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:58:54,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:58:54,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:58:54,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:58:54,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:58:54,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:54,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:58:54,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:58:54,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:58:54,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:58:54,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:58:54,478 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:58:54,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:58:54,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:58:54,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:58:54,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:58:54,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:58:54,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:58:54,763 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:58:54,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.opt.i [2019-12-18 21:58:54,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4653c19b/2472a06671544488a969f2032d995ea4/FLAG4fe9bb663 [2019-12-18 21:58:55,460 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:58:55,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.opt.i [2019-12-18 21:58:55,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4653c19b/2472a06671544488a969f2032d995ea4/FLAG4fe9bb663 [2019-12-18 21:58:55,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4653c19b/2472a06671544488a969f2032d995ea4 [2019-12-18 21:58:55,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:58:55,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:58:55,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:55,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:58:55,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:58:55,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:55" (1/1) ... [2019-12-18 21:58:55,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:55, skipping insertion in model container [2019-12-18 21:58:55,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:58:55" (1/1) ... [2019-12-18 21:58:55,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:58:55,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:58:56,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:56,405 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:58:56,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:58:56,565 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:58:56,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56 WrapperNode [2019-12-18 21:58:56,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:58:56,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:56,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:58:56,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:58:56,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:58:56,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:58:56,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:58:56,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:58:56,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... [2019-12-18 21:58:56,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:58:56,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:58:56,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:58:56,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:58:56,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:58:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:58:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:58:56,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:58:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:58:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:58:56,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:58:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:58:56,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:58:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:58:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:58:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:58:56,766 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:58:57,801 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:58:57,802 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:58:57,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:57 BoogieIcfgContainer [2019-12-18 21:58:57,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:58:57,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:58:57,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:58:57,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:58:57,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:58:55" (1/3) ... [2019-12-18 21:58:57,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5516c841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:57, skipping insertion in model container [2019-12-18 21:58:57,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:58:56" (2/3) ... [2019-12-18 21:58:57,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5516c841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:58:57, skipping insertion in model container [2019-12-18 21:58:57,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:58:57" (3/3) ... [2019-12-18 21:58:57,812 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.opt.i [2019-12-18 21:58:57,822 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:58:57,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:58:57,830 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:58:57,831 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:58:57,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:58:57,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:58:57,986 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:58:57,986 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:58:57,986 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:58:57,986 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:58:57,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:58:57,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:58:57,987 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:58:57,987 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:58:58,005 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-18 21:58:58,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 21:58:58,131 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 21:58:58,132 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:58,170 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 21:58:58,240 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 21:58:58,351 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 21:58:58,352 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:58:58,375 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 21:58:58,451 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-18 21:58:58,452 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:59:02,141 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:59:02,260 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:59:02,329 INFO L206 etLargeBlockEncoding]: Checked pairs total: 240611 [2019-12-18 21:59:02,329 INFO L214 etLargeBlockEncoding]: Total number of compositions: 135 [2019-12-18 21:59:02,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 187 transitions [2019-12-18 21:59:06,172 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 51378 states. [2019-12-18 21:59:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51378 states. [2019-12-18 21:59:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 21:59:06,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:06,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 21:59:06,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1263882776, now seen corresponding path program 1 times [2019-12-18 21:59:06,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:06,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067299109] [2019-12-18 21:59:06,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:06,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067299109] [2019-12-18 21:59:06,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:06,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:59:06,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232224525] [2019-12-18 21:59:06,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:06,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:06,487 INFO L87 Difference]: Start difference. First operand 51378 states. Second operand 3 states. [2019-12-18 21:59:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,529 INFO L93 Difference]: Finished difference Result 51288 states and 183394 transitions. [2019-12-18 21:59:07,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:07,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 21:59:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:08,001 INFO L225 Difference]: With dead ends: 51288 [2019-12-18 21:59:08,001 INFO L226 Difference]: Without dead ends: 50287 [2019-12-18 21:59:08,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50287 states. [2019-12-18 21:59:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50287 to 50287. [2019-12-18 21:59:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50287 states. [2019-12-18 21:59:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50287 states to 50287 states and 180053 transitions. [2019-12-18 21:59:12,004 INFO L78 Accepts]: Start accepts. Automaton has 50287 states and 180053 transitions. Word has length 5 [2019-12-18 21:59:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:12,004 INFO L462 AbstractCegarLoop]: Abstraction has 50287 states and 180053 transitions. [2019-12-18 21:59:12,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 50287 states and 180053 transitions. [2019-12-18 21:59:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:12,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:12,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:12,008 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash 912819133, now seen corresponding path program 1 times [2019-12-18 21:59:12,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:12,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623967717] [2019-12-18 21:59:12,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:12,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623967717] [2019-12-18 21:59:12,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:12,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:12,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144749971] [2019-12-18 21:59:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:12,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:12,103 INFO L87 Difference]: Start difference. First operand 50287 states and 180053 transitions. Second operand 4 states. [2019-12-18 21:59:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:14,361 INFO L93 Difference]: Finished difference Result 70131 states and 243701 transitions. [2019-12-18 21:59:14,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:14,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:14,720 INFO L225 Difference]: With dead ends: 70131 [2019-12-18 21:59:14,721 INFO L226 Difference]: Without dead ends: 70131 [2019-12-18 21:59:14,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70131 states. [2019-12-18 21:59:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70131 to 69751. [2019-12-18 21:59:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69751 states. [2019-12-18 21:59:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69751 states to 69751 states and 242647 transitions. [2019-12-18 21:59:17,664 INFO L78 Accepts]: Start accepts. Automaton has 69751 states and 242647 transitions. Word has length 11 [2019-12-18 21:59:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:17,664 INFO L462 AbstractCegarLoop]: Abstraction has 69751 states and 242647 transitions. [2019-12-18 21:59:17,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69751 states and 242647 transitions. [2019-12-18 21:59:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:59:17,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:17,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:17,667 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1971624387, now seen corresponding path program 1 times [2019-12-18 21:59:17,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:17,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888332995] [2019-12-18 21:59:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:17,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888332995] [2019-12-18 21:59:17,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:17,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:17,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145969410] [2019-12-18 21:59:17,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:17,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:17,771 INFO L87 Difference]: Start difference. First operand 69751 states and 242647 transitions. Second operand 4 states. [2019-12-18 21:59:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:20,672 INFO L93 Difference]: Finished difference Result 101782 states and 344109 transitions. [2019-12-18 21:59:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:20,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:59:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:21,243 INFO L225 Difference]: With dead ends: 101782 [2019-12-18 21:59:21,244 INFO L226 Difference]: Without dead ends: 101775 [2019-12-18 21:59:21,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101775 states. [2019-12-18 21:59:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101775 to 90052. [2019-12-18 21:59:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90052 states. [2019-12-18 21:59:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90052 states to 90052 states and 307827 transitions. [2019-12-18 21:59:24,686 INFO L78 Accepts]: Start accepts. Automaton has 90052 states and 307827 transitions. Word has length 11 [2019-12-18 21:59:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:24,686 INFO L462 AbstractCegarLoop]: Abstraction has 90052 states and 307827 transitions. [2019-12-18 21:59:24,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 90052 states and 307827 transitions. [2019-12-18 21:59:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:59:24,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:24,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:24,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:24,694 INFO L82 PathProgramCache]: Analyzing trace with hash 189196648, now seen corresponding path program 1 times [2019-12-18 21:59:24,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:24,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507386038] [2019-12-18 21:59:24,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:24,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507386038] [2019-12-18 21:59:24,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:24,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:24,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687311816] [2019-12-18 21:59:24,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:24,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:24,809 INFO L87 Difference]: Start difference. First operand 90052 states and 307827 transitions. Second operand 5 states. [2019-12-18 21:59:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:26,761 INFO L93 Difference]: Finished difference Result 118960 states and 399285 transitions. [2019-12-18 21:59:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:59:26,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:59:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:27,025 INFO L225 Difference]: With dead ends: 118960 [2019-12-18 21:59:27,025 INFO L226 Difference]: Without dead ends: 118953 [2019-12-18 21:59:27,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:59:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118953 states. [2019-12-18 21:59:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118953 to 90045. [2019-12-18 21:59:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90045 states. [2019-12-18 21:59:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90045 states to 90045 states and 307634 transitions. [2019-12-18 21:59:33,027 INFO L78 Accepts]: Start accepts. Automaton has 90045 states and 307634 transitions. Word has length 17 [2019-12-18 21:59:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:33,027 INFO L462 AbstractCegarLoop]: Abstraction has 90045 states and 307634 transitions. [2019-12-18 21:59:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 90045 states and 307634 transitions. [2019-12-18 21:59:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:33,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:33,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:33,052 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1696643626, now seen corresponding path program 1 times [2019-12-18 21:59:33,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:33,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493127217] [2019-12-18 21:59:33,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:33,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493127217] [2019-12-18 21:59:33,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:33,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:33,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604821187] [2019-12-18 21:59:33,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:33,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:33,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:33,135 INFO L87 Difference]: Start difference. First operand 90045 states and 307634 transitions. Second operand 4 states. [2019-12-18 21:59:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:33,195 INFO L93 Difference]: Finished difference Result 9700 states and 24669 transitions. [2019-12-18 21:59:33,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:33,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:59:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:33,207 INFO L225 Difference]: With dead ends: 9700 [2019-12-18 21:59:33,207 INFO L226 Difference]: Without dead ends: 8091 [2019-12-18 21:59:33,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2019-12-18 21:59:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 8091. [2019-12-18 21:59:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2019-12-18 21:59:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 19664 transitions. [2019-12-18 21:59:33,307 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 19664 transitions. Word has length 25 [2019-12-18 21:59:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:33,308 INFO L462 AbstractCegarLoop]: Abstraction has 8091 states and 19664 transitions. [2019-12-18 21:59:33,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 19664 transitions. [2019-12-18 21:59:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:59:33,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:33,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:33,313 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash -472381303, now seen corresponding path program 1 times [2019-12-18 21:59:33,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:33,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273597890] [2019-12-18 21:59:33,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:33,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273597890] [2019-12-18 21:59:33,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:33,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:33,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251762784] [2019-12-18 21:59:33,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:33,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:33,475 INFO L87 Difference]: Start difference. First operand 8091 states and 19664 transitions. Second operand 5 states. [2019-12-18 21:59:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:34,058 INFO L93 Difference]: Finished difference Result 1879 states and 4087 transitions. [2019-12-18 21:59:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:34,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 21:59:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:34,061 INFO L225 Difference]: With dead ends: 1879 [2019-12-18 21:59:34,061 INFO L226 Difference]: Without dead ends: 1707 [2019-12-18 21:59:34,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-12-18 21:59:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1637. [2019-12-18 21:59:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-18 21:59:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 3578 transitions. [2019-12-18 21:59:34,077 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 3578 transitions. Word has length 37 [2019-12-18 21:59:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:34,077 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 3578 transitions. [2019-12-18 21:59:34,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 3578 transitions. [2019-12-18 21:59:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 21:59:34,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:34,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:34,082 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1952682634, now seen corresponding path program 1 times [2019-12-18 21:59:34,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043041182] [2019-12-18 21:59:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:34,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043041182] [2019-12-18 21:59:34,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:34,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:34,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001657424] [2019-12-18 21:59:34,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:34,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:34,180 INFO L87 Difference]: Start difference. First operand 1637 states and 3578 transitions. Second operand 3 states. [2019-12-18 21:59:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:34,196 INFO L93 Difference]: Finished difference Result 1637 states and 3502 transitions. [2019-12-18 21:59:34,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:34,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-18 21:59:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:34,199 INFO L225 Difference]: With dead ends: 1637 [2019-12-18 21:59:34,199 INFO L226 Difference]: Without dead ends: 1637 [2019-12-18 21:59:34,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-12-18 21:59:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2019-12-18 21:59:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-18 21:59:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 3502 transitions. [2019-12-18 21:59:34,215 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 3502 transitions. Word has length 83 [2019-12-18 21:59:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:34,215 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 3502 transitions. [2019-12-18 21:59:34,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 3502 transitions. [2019-12-18 21:59:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 21:59:34,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:34,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:34,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1163871079, now seen corresponding path program 1 times [2019-12-18 21:59:34,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:34,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233961721] [2019-12-18 21:59:34,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:34,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233961721] [2019-12-18 21:59:34,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:34,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:59:34,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243664233] [2019-12-18 21:59:34,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:34,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:34,348 INFO L87 Difference]: Start difference. First operand 1637 states and 3502 transitions. Second operand 5 states. [2019-12-18 21:59:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:34,668 INFO L93 Difference]: Finished difference Result 1775 states and 3750 transitions. [2019-12-18 21:59:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:59:34,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-18 21:59:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:34,671 INFO L225 Difference]: With dead ends: 1775 [2019-12-18 21:59:34,671 INFO L226 Difference]: Without dead ends: 1775 [2019-12-18 21:59:34,672 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-18 21:59:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-18 21:59:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1722. [2019-12-18 21:59:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-18 21:59:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 3656 transitions. [2019-12-18 21:59:34,688 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 3656 transitions. Word has length 84 [2019-12-18 21:59:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:34,688 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 3656 transitions. [2019-12-18 21:59:34,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3656 transitions. [2019-12-18 21:59:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 21:59:34,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:34,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:34,691 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1309398995, now seen corresponding path program 2 times [2019-12-18 21:59:34,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:34,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603347633] [2019-12-18 21:59:34,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:34,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603347633] [2019-12-18 21:59:34,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:34,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:34,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984257061] [2019-12-18 21:59:34,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:34,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:34,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:34,920 INFO L87 Difference]: Start difference. First operand 1722 states and 3656 transitions. Second operand 10 states. [2019-12-18 21:59:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:35,484 INFO L93 Difference]: Finished difference Result 2912 states and 6150 transitions. [2019-12-18 21:59:35,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:59:35,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-18 21:59:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:35,489 INFO L225 Difference]: With dead ends: 2912 [2019-12-18 21:59:35,490 INFO L226 Difference]: Without dead ends: 2880 [2019-12-18 21:59:35,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:59:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2019-12-18 21:59:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2349. [2019-12-18 21:59:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-12-18 21:59:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5010 transitions. [2019-12-18 21:59:35,512 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5010 transitions. Word has length 84 [2019-12-18 21:59:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:35,513 INFO L462 AbstractCegarLoop]: Abstraction has 2349 states and 5010 transitions. [2019-12-18 21:59:35,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5010 transitions. [2019-12-18 21:59:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 21:59:35,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:35,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:35,518 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1538019734, now seen corresponding path program 1 times [2019-12-18 21:59:35,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:35,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131390662] [2019-12-18 21:59:35,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:35,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131390662] [2019-12-18 21:59:35,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:35,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:59:35,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274260653] [2019-12-18 21:59:35,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:59:35,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:59:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:59:35,865 INFO L87 Difference]: Start difference. First operand 2349 states and 5010 transitions. Second operand 14 states. [2019-12-18 21:59:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:36,926 INFO L93 Difference]: Finished difference Result 3124 states and 6511 transitions. [2019-12-18 21:59:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 21:59:36,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-12-18 21:59:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:36,932 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 21:59:36,932 INFO L226 Difference]: Without dead ends: 3020 [2019-12-18 21:59:36,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:59:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2019-12-18 21:59:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2107. [2019-12-18 21:59:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-12-18 21:59:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 4536 transitions. [2019-12-18 21:59:36,958 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 4536 transitions. Word has length 85 [2019-12-18 21:59:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:36,958 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 4536 transitions. [2019-12-18 21:59:36,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:59:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 4536 transitions. [2019-12-18 21:59:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 21:59:36,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:36,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:36,962 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash 967779120, now seen corresponding path program 2 times [2019-12-18 21:59:36,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:36,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065329032] [2019-12-18 21:59:36,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:37,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065329032] [2019-12-18 21:59:37,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:37,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:59:37,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893210641] [2019-12-18 21:59:37,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:37,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:37,072 INFO L87 Difference]: Start difference. First operand 2107 states and 4536 transitions. Second operand 5 states. [2019-12-18 21:59:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:37,339 INFO L93 Difference]: Finished difference Result 3339 states and 7189 transitions. [2019-12-18 21:59:37,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:59:37,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-18 21:59:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:37,343 INFO L225 Difference]: With dead ends: 3339 [2019-12-18 21:59:37,343 INFO L226 Difference]: Without dead ends: 3339 [2019-12-18 21:59:37,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-12-18 21:59:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2716. [2019-12-18 21:59:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-18 21:59:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 5807 transitions. [2019-12-18 21:59:37,385 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 5807 transitions. Word has length 85 [2019-12-18 21:59:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:37,385 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 5807 transitions. [2019-12-18 21:59:37,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 5807 transitions. [2019-12-18 21:59:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:59:37,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:37,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:37,393 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1587128272, now seen corresponding path program 1 times [2019-12-18 21:59:37,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:37,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551054473] [2019-12-18 21:59:37,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:37,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551054473] [2019-12-18 21:59:37,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:37,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:37,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934398772] [2019-12-18 21:59:37,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:59:37,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:59:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:37,627 INFO L87 Difference]: Start difference. First operand 2716 states and 5807 transitions. Second operand 11 states. [2019-12-18 21:59:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:38,073 INFO L93 Difference]: Finished difference Result 4542 states and 9660 transitions. [2019-12-18 21:59:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:38,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-18 21:59:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:38,080 INFO L225 Difference]: With dead ends: 4542 [2019-12-18 21:59:38,080 INFO L226 Difference]: Without dead ends: 4413 [2019-12-18 21:59:38,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:59:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-18 21:59:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4126. [2019-12-18 21:59:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2019-12-18 21:59:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 8907 transitions. [2019-12-18 21:59:38,122 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 8907 transitions. Word has length 86 [2019-12-18 21:59:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:38,123 INFO L462 AbstractCegarLoop]: Abstraction has 4126 states and 8907 transitions. [2019-12-18 21:59:38,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:59:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 8907 transitions. [2019-12-18 21:59:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:59:38,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:38,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:38,128 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1464575879, now seen corresponding path program 1 times [2019-12-18 21:59:38,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:38,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802299113] [2019-12-18 21:59:38,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:39,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802299113] [2019-12-18 21:59:39,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:39,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:39,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342828143] [2019-12-18 21:59:39,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:39,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:39,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:39,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:39,157 INFO L87 Difference]: Start difference. First operand 4126 states and 8907 transitions. Second operand 10 states. [2019-12-18 21:59:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:40,411 INFO L93 Difference]: Finished difference Result 6542 states and 14057 transitions. [2019-12-18 21:59:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:40,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-18 21:59:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:40,419 INFO L225 Difference]: With dead ends: 6542 [2019-12-18 21:59:40,419 INFO L226 Difference]: Without dead ends: 6493 [2019-12-18 21:59:40,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:59:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2019-12-18 21:59:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 4571. [2019-12-18 21:59:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2019-12-18 21:59:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 9872 transitions. [2019-12-18 21:59:40,475 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 9872 transitions. Word has length 86 [2019-12-18 21:59:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:40,476 INFO L462 AbstractCegarLoop]: Abstraction has 4571 states and 9872 transitions. [2019-12-18 21:59:40,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:40,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 9872 transitions. [2019-12-18 21:59:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:59:40,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:40,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:40,484 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash 20196231, now seen corresponding path program 2 times [2019-12-18 21:59:40,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:40,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507475552] [2019-12-18 21:59:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:40,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507475552] [2019-12-18 21:59:40,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:40,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:40,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762881471] [2019-12-18 21:59:40,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:40,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:40,725 INFO L87 Difference]: Start difference. First operand 4571 states and 9872 transitions. Second operand 10 states. [2019-12-18 21:59:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:42,171 INFO L93 Difference]: Finished difference Result 7023 states and 15111 transitions. [2019-12-18 21:59:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:59:42,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-18 21:59:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:42,180 INFO L225 Difference]: With dead ends: 7023 [2019-12-18 21:59:42,181 INFO L226 Difference]: Without dead ends: 6974 [2019-12-18 21:59:42,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:59:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-12-18 21:59:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 4421. [2019-12-18 21:59:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2019-12-18 21:59:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 9518 transitions. [2019-12-18 21:59:42,236 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 9518 transitions. Word has length 86 [2019-12-18 21:59:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:42,236 INFO L462 AbstractCegarLoop]: Abstraction has 4421 states and 9518 transitions. [2019-12-18 21:59:42,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 9518 transitions. [2019-12-18 21:59:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:59:42,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:42,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:42,245 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 332745065, now seen corresponding path program 3 times [2019-12-18 21:59:42,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:42,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120600307] [2019-12-18 21:59:42,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:42,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120600307] [2019-12-18 21:59:42,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:42,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:42,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710034978] [2019-12-18 21:59:42,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:42,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:42,451 INFO L87 Difference]: Start difference. First operand 4421 states and 9518 transitions. Second operand 10 states. [2019-12-18 21:59:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:43,567 INFO L93 Difference]: Finished difference Result 6598 states and 14148 transitions. [2019-12-18 21:59:43,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:59:43,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-18 21:59:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:43,576 INFO L225 Difference]: With dead ends: 6598 [2019-12-18 21:59:43,577 INFO L226 Difference]: Without dead ends: 6598 [2019-12-18 21:59:43,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:59:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-12-18 21:59:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 4363. [2019-12-18 21:59:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4363 states. [2019-12-18 21:59:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 9393 transitions. [2019-12-18 21:59:43,641 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 9393 transitions. Word has length 86 [2019-12-18 21:59:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:43,641 INFO L462 AbstractCegarLoop]: Abstraction has 4363 states and 9393 transitions. [2019-12-18 21:59:43,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 9393 transitions. [2019-12-18 21:59:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 21:59:43,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:43,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:43,647 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1294898533, now seen corresponding path program 4 times [2019-12-18 21:59:43,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:43,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169575214] [2019-12-18 21:59:43,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:43,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169575214] [2019-12-18 21:59:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:59:43,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416289429] [2019-12-18 21:59:43,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:59:43,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:59:43,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:59:43,839 INFO L87 Difference]: Start difference. First operand 4363 states and 9393 transitions. Second operand 9 states. [2019-12-18 21:59:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:44,619 INFO L93 Difference]: Finished difference Result 9776 states and 21168 transitions. [2019-12-18 21:59:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:59:44,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-18 21:59:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:44,632 INFO L225 Difference]: With dead ends: 9776 [2019-12-18 21:59:44,632 INFO L226 Difference]: Without dead ends: 6790 [2019-12-18 21:59:44,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:59:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-18 21:59:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 4622. [2019-12-18 21:59:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2019-12-18 21:59:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 9907 transitions. [2019-12-18 21:59:44,749 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 9907 transitions. Word has length 86 [2019-12-18 21:59:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:44,750 INFO L462 AbstractCegarLoop]: Abstraction has 4622 states and 9907 transitions. [2019-12-18 21:59:44,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:59:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 9907 transitions. [2019-12-18 21:59:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:59:44,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:44,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:44,762 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 509984995, now seen corresponding path program 1 times [2019-12-18 21:59:44,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:44,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690931133] [2019-12-18 21:59:44,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:46,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690931133] [2019-12-18 21:59:46,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:46,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 21:59:46,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038699220] [2019-12-18 21:59:46,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 21:59:46,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 21:59:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:59:46,211 INFO L87 Difference]: Start difference. First operand 4622 states and 9907 transitions. Second operand 25 states. [2019-12-18 21:59:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:55,490 INFO L93 Difference]: Finished difference Result 9044 states and 19440 transitions. [2019-12-18 21:59:55,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 21:59:55,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-12-18 21:59:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:55,500 INFO L225 Difference]: With dead ends: 9044 [2019-12-18 21:59:55,501 INFO L226 Difference]: Without dead ends: 8904 [2019-12-18 21:59:55,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 21:59:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8904 states. [2019-12-18 21:59:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8904 to 4888. [2019-12-18 21:59:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-18 21:59:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10514 transitions. [2019-12-18 21:59:55,560 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10514 transitions. Word has length 87 [2019-12-18 21:59:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:55,560 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10514 transitions. [2019-12-18 21:59:55,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 21:59:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10514 transitions. [2019-12-18 21:59:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:59:55,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:55,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:55,566 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1059692081, now seen corresponding path program 2 times [2019-12-18 21:59:55,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:55,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063265248] [2019-12-18 21:59:55,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:56,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063265248] [2019-12-18 21:59:56,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:56,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:59:56,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390796665] [2019-12-18 21:59:56,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:59:56,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:59:56,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:59:56,053 INFO L87 Difference]: Start difference. First operand 4888 states and 10514 transitions. Second operand 18 states. [2019-12-18 21:59:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:58,807 INFO L93 Difference]: Finished difference Result 8122 states and 17491 transitions. [2019-12-18 21:59:58,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 21:59:58,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-12-18 21:59:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:58,816 INFO L225 Difference]: With dead ends: 8122 [2019-12-18 21:59:58,816 INFO L226 Difference]: Without dead ends: 7965 [2019-12-18 21:59:58,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 21:59:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7965 states. [2019-12-18 21:59:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7965 to 4951. [2019-12-18 21:59:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4951 states. [2019-12-18 21:59:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 10668 transitions. [2019-12-18 21:59:58,873 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 10668 transitions. Word has length 87 [2019-12-18 21:59:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:58,873 INFO L462 AbstractCegarLoop]: Abstraction has 4951 states and 10668 transitions. [2019-12-18 21:59:58,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:59:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 10668 transitions. [2019-12-18 21:59:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 21:59:58,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:58,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:58,879 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1551378967, now seen corresponding path program 3 times [2019-12-18 21:59:58,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:58,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856979203] [2019-12-18 21:59:58,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:59,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856979203] [2019-12-18 21:59:59,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:59,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:59:59,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436612832] [2019-12-18 21:59:59,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:59:59,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:59:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:59:59,587 INFO L87 Difference]: Start difference. First operand 4951 states and 10668 transitions. Second operand 20 states. [2019-12-18 22:00:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:03,393 INFO L93 Difference]: Finished difference Result 10380 states and 22358 transitions. [2019-12-18 22:00:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:00:03,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-12-18 22:00:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:03,405 INFO L225 Difference]: With dead ends: 10380 [2019-12-18 22:00:03,406 INFO L226 Difference]: Without dead ends: 10260 [2019-12-18 22:00:03,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=289, Invalid=1781, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 22:00:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2019-12-18 22:00:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 5059. [2019-12-18 22:00:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5059 states. [2019-12-18 22:00:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5059 states to 5059 states and 10911 transitions. [2019-12-18 22:00:03,477 INFO L78 Accepts]: Start accepts. Automaton has 5059 states and 10911 transitions. Word has length 87 [2019-12-18 22:00:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:03,477 INFO L462 AbstractCegarLoop]: Abstraction has 5059 states and 10911 transitions. [2019-12-18 22:00:03,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 22:00:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5059 states and 10911 transitions. [2019-12-18 22:00:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 22:00:03,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:03,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:03,484 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1430935741, now seen corresponding path program 4 times [2019-12-18 22:00:03,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:03,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675141368] [2019-12-18 22:00:03,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:04,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675141368] [2019-12-18 22:00:04,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:04,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 22:00:04,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609891324] [2019-12-18 22:00:04,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 22:00:04,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 22:00:04,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:00:04,275 INFO L87 Difference]: Start difference. First operand 5059 states and 10911 transitions. Second operand 22 states. [2019-12-18 22:00:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:08,631 INFO L93 Difference]: Finished difference Result 9621 states and 20757 transitions. [2019-12-18 22:00:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 22:00:08,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-12-18 22:00:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:08,643 INFO L225 Difference]: With dead ends: 9621 [2019-12-18 22:00:08,643 INFO L226 Difference]: Without dead ends: 9471 [2019-12-18 22:00:08,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=264, Invalid=1806, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 22:00:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9471 states. [2019-12-18 22:00:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9471 to 5334. [2019-12-18 22:00:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5334 states. [2019-12-18 22:00:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 11542 transitions. [2019-12-18 22:00:08,712 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 11542 transitions. Word has length 87 [2019-12-18 22:00:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:08,713 INFO L462 AbstractCegarLoop]: Abstraction has 5334 states and 11542 transitions. [2019-12-18 22:00:08,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 22:00:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 11542 transitions. [2019-12-18 22:00:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 22:00:08,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:08,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:08,719 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1407741859, now seen corresponding path program 5 times [2019-12-18 22:00:08,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:08,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994336834] [2019-12-18 22:00:08,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:00:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:00:08,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:00:08,846 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:00:08,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= (store .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_23| 1) |v_#valid_48|) (= |v_#NULL.offset_7| 0) (= 0 v_~y$r_buff0_thd2~0_127) (= 0 v_~y$r_buff1_thd1~0_20) (= 0 v_~weak$$choice2~0_48) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$w_buff1~0_39) (= v_~y~0_47 0) (= v_~y$r_buff0_thd0~0_65 0) (= v_~y$w_buff0_used~0_182 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~y$read_delayed_var~0.offset_5) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1599~0.base_23| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1599~0.base_23| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1599~0.base_23|) |v_ULTIMATE.start_main_~#t1599~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y$w_buff1_used~0_96 0) (= 0 v_~y$w_buff0~0_43) (= 0 v_~y$r_buff1_thd0~0_36) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_23|)) (= v_~y$read_delayed~0_5 0) (= 0 |v_#NULL.base_7|) (= 0 v_~y$flush_delayed~0_26) (= v_~main$tmp_guard1~0_15 0) (= 0 |v_ULTIMATE.start_main_~#t1599~0.offset_17|) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 0 v_~y$r_buff1_thd2~0_64) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1599~0.base_23|) (= 0 v_~__unbuffered_cnt~0_16) (= v_~y$r_buff0_thd1~0_20 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_9|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_9|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_14|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_12|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_7|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_11|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_12|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_14|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_11|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_14|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_20, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_13|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_13|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_11|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_12|, ~y$w_buff1~0=v_~y$w_buff1~0_39, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_13|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_9|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_9|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_13|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_11|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_20|, ~y$w_buff0~0=v_~y$w_buff0~0_43, ~y~0=v_~y~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t1599~0.base=|v_ULTIMATE.start_main_~#t1599~0.base_23|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_7|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_11|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1599~0.offset=|v_ULTIMATE.start_main_~#t1599~0.offset_17|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_12|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_64, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_13|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_~#t1600~0.offset, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1599~0.base, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_~#t1599~0.offset, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:00:08,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1264] [1264] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1600~0.offset_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1600~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13|) |v_ULTIMATE.start_main_~#t1600~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1600~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 22:00:08,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_42 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (= v_~y~0_31 v_~y$mem_tmp~0_10) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd2~0_89 1) (= |v_P1Thread1of1ForFork1_#t~nondet9_8| v_~weak$$choice0~0_6) (= v_~y$r_buff0_thd2~0_90 v_~y$r_buff1_thd2~0_49) (= v_~weak$$choice2~0_42 v_~y$flush_delayed~0_16) (= v_~y$r_buff0_thd0~0_47 v_~y$r_buff1_thd0~0_29)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_90, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~y~0=v_~y~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_29, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-18 22:00:08,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In248288402 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In248288402 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out248288402| ~y$w_buff0~0_In248288402) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out248288402| ~y$w_buff1~0_In248288402)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In248288402, ~y$w_buff1~0=~y$w_buff1~0_In248288402, ~y$w_buff0~0=~y$w_buff0~0_In248288402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In248288402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In248288402, ~y$w_buff1~0=~y$w_buff1~0_In248288402, ~y$w_buff0~0=~y$w_buff0~0_In248288402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In248288402, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out248288402|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:00:08,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_28 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_7|, ~y~0=v_~y~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-18 22:00:08,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_45 256) 0)) (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_45} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_45, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 22:00:08,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2122156195 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-2122156195| ~y$mem_tmp~0_In-2122156195) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-2122156195| ~y~0_In-2122156195) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2122156195, ~y$flush_delayed~0=~y$flush_delayed~0_In-2122156195, ~y~0=~y~0_In-2122156195} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2122156195, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2122156195|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2122156195, ~y~0=~y~0_In-2122156195} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 22:00:08,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In275454394 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In275454394 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out275454394| |P0Thread1of1ForFork0_#t~ite4_Out275454394|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out275454394| ~y~0_In275454394) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out275454394| ~y$w_buff1~0_In275454394)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In275454394, ~y$w_buff1~0=~y$w_buff1~0_In275454394, ~y~0=~y~0_In275454394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In275454394} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In275454394, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out275454394|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out275454394|, ~y$w_buff1~0=~y$w_buff1~0_In275454394, ~y~0=~y~0_In275454394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In275454394} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:00:08,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-339948916 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-339948916 256)))) (or (and (= ~y$w_buff0~0_In-339948916 |P1Thread1of1ForFork1_#t~ite34_Out-339948916|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-339948916 |P1Thread1of1ForFork1_#t~ite34_Out-339948916|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-339948916, ~y$w_buff1~0=~y$w_buff1~0_In-339948916, ~y$w_buff0~0=~y$w_buff0~0_In-339948916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-339948916} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-339948916, ~y$w_buff1~0=~y$w_buff1~0_In-339948916, ~y$w_buff0~0=~y$w_buff0~0_In-339948916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-339948916, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-339948916|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:00:08,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_32 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-18 22:00:08,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~y$r_buff0_thd2~0_102 v_~y$r_buff0_thd2~0_101)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_43, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 22:00:08,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2134386757 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-2134386757| ~y~0_In-2134386757)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-2134386757| ~y$mem_tmp~0_In-2134386757) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2134386757, ~y$flush_delayed~0=~y$flush_delayed~0_In-2134386757, ~y~0=~y~0_In-2134386757} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2134386757, ~y$flush_delayed~0=~y$flush_delayed~0_In-2134386757, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-2134386757|, ~y~0=~y~0_In-2134386757} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 22:00:08,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-696136174 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-696136174 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-696136174| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-696136174| ~y$w_buff0_used~0_In-696136174) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-696136174, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-696136174} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-696136174|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696136174, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-696136174} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:00:08,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1666103854 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1666103854 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1666103854 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1666103854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1666103854| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1666103854| ~y$w_buff1_used~0_In-1666103854)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1666103854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666103854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666103854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666103854} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1666103854|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1666103854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666103854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1666103854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666103854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:00:08,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1410700904 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1410700904 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1410700904|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In1410700904 |P0Thread1of1ForFork0_#t~ite7_Out1410700904|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1410700904, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1410700904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1410700904, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1410700904|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1410700904} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:00:08,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1502073593 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1502073593 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1502073593 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1502073593 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1502073593 |P0Thread1of1ForFork0_#t~ite8_Out1502073593|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1502073593|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1502073593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502073593, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1502073593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502073593} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1502073593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1502073593, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1502073593|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1502073593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1502073593} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:00:08,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1265] [1265] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} 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-18 22:00:08,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1638635312 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1638635312 256)))) (or (and (= ~y$w_buff0_used~0_In-1638635312 |P1Thread1of1ForFork1_#t~ite57_Out-1638635312|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-1638635312|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1638635312, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1638635312} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1638635312, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1638635312, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1638635312|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-18 22:00:08,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1609144034 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1609144034 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1609144034 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1609144034 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite58_Out1609144034| ~y$w_buff1_used~0_In1609144034) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out1609144034|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609144034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609144034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609144034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609144034} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609144034, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609144034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609144034, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out1609144034|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609144034} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-18 22:00:08,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1236233725 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1236233725 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1236233725 ~y$r_buff0_thd2~0_Out1236233725) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1236233725) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1236233725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1236233725} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1236233725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1236233725, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1236233725|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-18 22:00:08,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-91379999 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-91379999 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-91379999 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-91379999 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out-91379999|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-91379999 |P1Thread1of1ForFork1_#t~ite60_Out-91379999|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-91379999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91379999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91379999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-91379999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-91379999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-91379999, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-91379999|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-91379999, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-91379999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-18 22:00:08,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1276] [1276] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork1_#t~ite60_8|)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_58, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:00:08,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_142 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_51 256))) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_142, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_142, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:00:08,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-24789870 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-24789870 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-24789870 |ULTIMATE.start_main_#t~ite63_Out-24789870|)) (and (not .cse0) (= ~y$w_buff1~0_In-24789870 |ULTIMATE.start_main_#t~ite63_Out-24789870|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-24789870, ~y~0=~y~0_In-24789870, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-24789870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24789870} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-24789870|, ~y$w_buff1~0=~y$w_buff1~0_In-24789870, ~y~0=~y~0_In-24789870, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-24789870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-24789870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 22:00:08,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite63_8|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_8|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_7|, ~y~0=v_~y~0_34, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 22:00:08,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In913130440 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In913130440 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out913130440|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In913130440 |ULTIMATE.start_main_#t~ite65_Out913130440|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In913130440, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In913130440} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In913130440, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In913130440, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out913130440|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 22:00:08,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1529796970 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1529796970 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1529796970 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1529796970 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-1529796970|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1529796970 |ULTIMATE.start_main_#t~ite66_Out-1529796970|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1529796970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1529796970, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1529796970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1529796970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1529796970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1529796970, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1529796970|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1529796970, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1529796970} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 22:00:08,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1806868313 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1806868313 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite67_Out-1806868313| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1806868313| ~y$r_buff0_thd0~0_In-1806868313) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1806868313, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1806868313} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1806868313, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1806868313, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1806868313|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 22:00:08,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-804503437 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-804503437 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-804503437 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-804503437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out-804503437| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-804503437| ~y$r_buff1_thd0~0_In-804503437)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-804503437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804503437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804503437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804503437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-804503437, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804503437, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-804503437|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-804503437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-804503437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 22:00:08,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1209595999 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out1209595999| ~y$mem_tmp~0_In1209595999) (not .cse0)) (and (= ~y~0_In1209595999 |ULTIMATE.start_main_#t~ite91_Out1209595999|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1209595999, ~y$flush_delayed~0=~y$flush_delayed~0_In1209595999, ~y~0=~y~0_In1209595999} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1209595999, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1209595999|, ~y$flush_delayed~0=~y$flush_delayed~0_In1209595999, ~y~0=~y~0_In1209595999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-18 22:00:08,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~y$flush_delayed~0_19) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_38 |v_ULTIMATE.start_main_#t~ite91_11|)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_10|, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:00:08,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:00:08 BasicIcfg [2019-12-18 22:00:08,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:00:09,000 INFO L168 Benchmark]: Toolchain (without parser) took 73288.65 ms. Allocated memory was 138.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.8 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 912.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,001 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.94 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 155.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.10 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 151.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,004 INFO L168 Benchmark]: Boogie Preprocessor took 60.99 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 147.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,006 INFO L168 Benchmark]: RCFGBuilder took 1099.64 ms. Allocated memory was 203.4 MB in the beginning and 236.5 MB in the end (delta: 33.0 MB). Free memory was 147.8 MB in the beginning and 194.7 MB in the end (delta: -46.9 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,007 INFO L168 Benchmark]: TraceAbstraction took 71193.77 ms. Allocated memory was 236.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 194.7 MB in the beginning and 1.1 GB in the end (delta: -916.3 MB). Peak memory consumption was 909.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,012 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.49 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.94 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 155.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.10 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 151.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.99 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 147.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1099.64 ms. Allocated memory was 203.4 MB in the beginning and 236.5 MB in the end (delta: 33.0 MB). Free memory was 147.8 MB in the beginning and 194.7 MB in the end (delta: -46.9 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71193.77 ms. Allocated memory was 236.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 194.7 MB in the beginning and 1.1 GB in the end (delta: -916.3 MB). Peak memory consumption was 909.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 231 ProgramPointsBefore, 149 ProgramPointsAfterwards, 307 TransitionsBefore, 187 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 41 ChoiceCompositions, 15225 VarBasedMoverChecksPositive, 305 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 240611 CheckedPairsTotal, 135 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L730] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L763] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L763] 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)) [L764] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L764] 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)) [L765] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L765] 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)) [L766] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L766] 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)) [L768] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L768] 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)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L778] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 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)) [L780] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 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)) [L781] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 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)) [L782] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 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)) [L784] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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) [L730] 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) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 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 [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5868 SDtfs, 9017 SDslu, 30039 SDs, 0 SdLazy, 24511 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 49 SyntacticMatches, 28 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90052occurred 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: 17.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 68734 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 692626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...