/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:39:06,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:39:06,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:39:06,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:39:06,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:39:06,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:39:06,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:39:06,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:39:06,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:39:06,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:39:06,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:39:06,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:39:06,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:39:06,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:39:06,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:39:06,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:39:06,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:39:06,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:39:06,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:39:06,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:39:06,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:39:06,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:39:06,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:39:06,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:39:06,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:39:06,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:39:06,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:39:06,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:39:06,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:39:06,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:39:06,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:39:06,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:39:06,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:39:06,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:39:06,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:39:06,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:39:06,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:39:06,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:39:06,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:39:06,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:39:06,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:39:06,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:39:06,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:39:06,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:39:06,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:39:06,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:39:06,279 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:39:06,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:39:06,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:39:06,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:39:06,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:39:06,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:39:06,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:39:06,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:39:06,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:39:06,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:39:06,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:39:06,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:39:06,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:39:06,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:39:06,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:39:06,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:39:06,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:39:06,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:06,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:39:06,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:39:06,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:39:06,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:39:06,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:39:06,288 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:39:06,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:39:06,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:39:06,289 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:39:06,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:39:06,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:39:06,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:39:06,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:39:06,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:39:06,652 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:39:06,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-27 21:39:06,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050a0db4d/f880c6af42bd4e87a38da38bfca04850/FLAG3953fbe2a [2019-12-27 21:39:07,279 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:39:07,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-27 21:39:07,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050a0db4d/f880c6af42bd4e87a38da38bfca04850/FLAG3953fbe2a [2019-12-27 21:39:07,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050a0db4d/f880c6af42bd4e87a38da38bfca04850 [2019-12-27 21:39:07,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:39:07,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:39:07,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:07,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:39:07,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:39:07,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:07" (1/1) ... [2019-12-27 21:39:07,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ff5c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:07, skipping insertion in model container [2019-12-27 21:39:07,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:07" (1/1) ... [2019-12-27 21:39:07,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:39:07,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:39:08,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:08,436 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:39:08,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:08,572 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:39:08,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08 WrapperNode [2019-12-27 21:39:08,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:08,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:08,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:39:08,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:39:08,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:08,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:39:08,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:39:08,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:39:08,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... [2019-12-27 21:39:08,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:39:08,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:39:08,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:39:08,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:39:08,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:39:08,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:39:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:39:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:39:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:39:08,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:39:08,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:39:08,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:39:08,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:39:08,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:39:08,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:39:08,752 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:39:09,429 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:39:09,429 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:39:09,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:09 BoogieIcfgContainer [2019-12-27 21:39:09,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:39:09,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:39:09,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:39:09,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:39:09,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:39:07" (1/3) ... [2019-12-27 21:39:09,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b604258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:09, skipping insertion in model container [2019-12-27 21:39:09,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:08" (2/3) ... [2019-12-27 21:39:09,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b604258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:09, skipping insertion in model container [2019-12-27 21:39:09,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:09" (3/3) ... [2019-12-27 21:39:09,445 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-12-27 21:39:09,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:39:09,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:39:09,469 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:39:09,470 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:39:09,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:09,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:39:09,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:39:09,661 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:39:09,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:39:09,661 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:39:09,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:39:09,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:39:09,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:39:09,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:39:09,678 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 21:39:09,680 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:09,770 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:09,770 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:09,783 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:09,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:09,849 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:09,849 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:09,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:09,869 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:39:09,870 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:39:12,693 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 21:39:12,993 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 21:39:13,102 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:39:13,125 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-27 21:39:13,125 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 21:39:13,128 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-27 21:39:13,651 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-27 21:39:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-27 21:39:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:39:13,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:13,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:39:13,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-27 21:39:13,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:13,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838559443] [2019-12-27 21:39:13,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:13,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838559443] [2019-12-27 21:39:14,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:14,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:14,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315079559] [2019-12-27 21:39:14,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:14,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:14,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:39:14,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:14,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:14,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:14,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:14,049 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-27 21:39:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:14,313 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-27 21:39:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:14,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:39:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:14,402 INFO L225 Difference]: With dead ends: 8310 [2019-12-27 21:39:14,402 INFO L226 Difference]: Without dead ends: 7790 [2019-12-27 21:39:14,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-27 21:39:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-27 21:39:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-27 21:39:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-27 21:39:14,931 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-27 21:39:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:14,931 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-27 21:39:14,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-27 21:39:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:14,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:14,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:14,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-27 21:39:14,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:14,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536843924] [2019-12-27 21:39:14,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:15,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536843924] [2019-12-27 21:39:15,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:15,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:15,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673940154] [2019-12-27 21:39:15,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:15,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:15,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:39:15,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:15,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:15,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:15,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:15,081 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-27 21:39:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:15,517 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-27 21:39:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:15,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:39:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:15,596 INFO L225 Difference]: With dead ends: 12240 [2019-12-27 21:39:15,597 INFO L226 Difference]: Without dead ends: 12233 [2019-12-27 21:39:15,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-27 21:39:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-27 21:39:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-27 21:39:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-27 21:39:16,618 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-27 21:39:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:16,619 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-27 21:39:16,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-27 21:39:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:39:16,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:16,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:16,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-27 21:39:16,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:16,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055088271] [2019-12-27 21:39:16,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:16,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055088271] [2019-12-27 21:39:16,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:16,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:16,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020800360] [2019-12-27 21:39:16,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:16,737 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:16,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:39:16,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:16,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:16,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:16,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:16,742 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-27 21:39:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:17,201 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-27 21:39:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:39:17,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:39:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:17,263 INFO L225 Difference]: With dead ends: 15483 [2019-12-27 21:39:17,263 INFO L226 Difference]: Without dead ends: 15483 [2019-12-27 21:39:17,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:39:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-27 21:39:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-27 21:39:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-27 21:39:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-27 21:39:17,882 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-27 21:39:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:17,884 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-27 21:39:17,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-27 21:39:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:39:17,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:17,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:17,888 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-27 21:39:17,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:17,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087548988] [2019-12-27 21:39:17,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:17,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087548988] [2019-12-27 21:39:17,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:17,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:17,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869579766] [2019-12-27 21:39:17,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:17,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:17,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:39:17,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:17,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:17,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:17,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:17,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:17,998 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-27 21:39:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:18,081 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-27 21:39:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:18,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:39:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:18,114 INFO L225 Difference]: With dead ends: 12387 [2019-12-27 21:39:18,114 INFO L226 Difference]: Without dead ends: 12387 [2019-12-27 21:39:18,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-27 21:39:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-27 21:39:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-27 21:39:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-27 21:39:18,593 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-27 21:39:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:18,593 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-27 21:39:18,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-27 21:39:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:39:18,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:18,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:18,598 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-27 21:39:18,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:18,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336179598] [2019-12-27 21:39:18,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:18,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336179598] [2019-12-27 21:39:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:18,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:18,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534330021] [2019-12-27 21:39:18,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:18,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:18,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:39:18,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:18,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:39:18,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:18,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:18,685 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 4 states. [2019-12-27 21:39:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:18,788 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-27 21:39:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:18,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:39:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:18,817 INFO L225 Difference]: With dead ends: 20943 [2019-12-27 21:39:18,817 INFO L226 Difference]: Without dead ends: 11612 [2019-12-27 21:39:18,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-27 21:39:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-27 21:39:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-27 21:39:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-27 21:39:19,894 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-27 21:39:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:19,894 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-27 21:39:19,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-27 21:39:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:39:19,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:19,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:19,900 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-27 21:39:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:19,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902756613] [2019-12-27 21:39:19,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:19,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902756613] [2019-12-27 21:39:19,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:19,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:19,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1429153832] [2019-12-27 21:39:19,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:19,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:19,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 32 transitions. [2019-12-27 21:39:19,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:19,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:20,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:39:20,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:39:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:39:20,001 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 4 states. [2019-12-27 21:39:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:20,039 INFO L93 Difference]: Finished difference Result 1835 states and 4564 transitions. [2019-12-27 21:39:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:20,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:39:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:20,043 INFO L225 Difference]: With dead ends: 1835 [2019-12-27 21:39:20,043 INFO L226 Difference]: Without dead ends: 1299 [2019-12-27 21:39:20,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-12-27 21:39:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1295. [2019-12-27 21:39:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-27 21:39:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2878 transitions. [2019-12-27 21:39:20,067 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2878 transitions. Word has length 17 [2019-12-27 21:39:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:20,068 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2878 transitions. [2019-12-27 21:39:20,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:39:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2878 transitions. [2019-12-27 21:39:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:39:20,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:20,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:20,071 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-27 21:39:20,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:20,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737344249] [2019-12-27 21:39:20,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:20,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737344249] [2019-12-27 21:39:20,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:20,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:39:20,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799615906] [2019-12-27 21:39:20,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:20,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:20,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:39:20,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:20,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:20,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:39:20,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:39:20,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:20,174 INFO L87 Difference]: Start difference. First operand 1295 states and 2878 transitions. Second operand 6 states. [2019-12-27 21:39:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:20,421 INFO L93 Difference]: Finished difference Result 1351 states and 2946 transitions. [2019-12-27 21:39:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:39:20,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:39:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:20,423 INFO L225 Difference]: With dead ends: 1351 [2019-12-27 21:39:20,424 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 21:39:20,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:39:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 21:39:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1253. [2019-12-27 21:39:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2019-12-27 21:39:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2773 transitions. [2019-12-27 21:39:20,449 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2773 transitions. Word has length 25 [2019-12-27 21:39:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:20,450 INFO L462 AbstractCegarLoop]: Abstraction has 1253 states and 2773 transitions. [2019-12-27 21:39:20,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:39:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2773 transitions. [2019-12-27 21:39:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:39:20,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:20,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:20,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1615008956, now seen corresponding path program 1 times [2019-12-27 21:39:20,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:20,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657724977] [2019-12-27 21:39:20,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:20,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657724977] [2019-12-27 21:39:20,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:20,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:39:20,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1089706850] [2019-12-27 21:39:20,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:20,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:20,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:39:20,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:20,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:20,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:39:20,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:39:20,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:20,696 INFO L87 Difference]: Start difference. First operand 1253 states and 2773 transitions. Second operand 8 states. [2019-12-27 21:39:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:21,569 INFO L93 Difference]: Finished difference Result 1954 states and 4236 transitions. [2019-12-27 21:39:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:21,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 21:39:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:21,574 INFO L225 Difference]: With dead ends: 1954 [2019-12-27 21:39:21,574 INFO L226 Difference]: Without dead ends: 1954 [2019-12-27 21:39:21,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:39:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-12-27 21:39:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1770. [2019-12-27 21:39:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2019-12-27 21:39:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 3881 transitions. [2019-12-27 21:39:21,616 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 3881 transitions. Word has length 27 [2019-12-27 21:39:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:21,616 INFO L462 AbstractCegarLoop]: Abstraction has 1770 states and 3881 transitions. [2019-12-27 21:39:21,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:39:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3881 transitions. [2019-12-27 21:39:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:39:21,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:21,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:21,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-27 21:39:21,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:21,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084530183] [2019-12-27 21:39:21,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:21,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084530183] [2019-12-27 21:39:21,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:21,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:39:21,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077652259] [2019-12-27 21:39:21,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:21,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:21,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 21:39:21,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:21,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:21,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:39:21,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:39:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:21,827 INFO L87 Difference]: Start difference. First operand 1770 states and 3881 transitions. Second operand 6 states. [2019-12-27 21:39:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:21,949 INFO L93 Difference]: Finished difference Result 1084 states and 2256 transitions. [2019-12-27 21:39:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:21,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:39:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:21,952 INFO L225 Difference]: With dead ends: 1084 [2019-12-27 21:39:21,954 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 21:39:21,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 21:39:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 850. [2019-12-27 21:39:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-27 21:39:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1827 transitions. [2019-12-27 21:39:21,977 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1827 transitions. Word has length 28 [2019-12-27 21:39:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:21,977 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1827 transitions. [2019-12-27 21:39:21,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:39:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1827 transitions. [2019-12-27 21:39:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:39:21,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:21,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:21,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1467449375, now seen corresponding path program 1 times [2019-12-27 21:39:21,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:21,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487127743] [2019-12-27 21:39:21,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:22,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487127743] [2019-12-27 21:39:22,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:22,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:22,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732562277] [2019-12-27 21:39:22,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:22,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:22,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:39:22,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:22,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:22,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:22,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:22,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:22,222 INFO L87 Difference]: Start difference. First operand 850 states and 1827 transitions. Second operand 3 states. [2019-12-27 21:39:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:22,274 INFO L93 Difference]: Finished difference Result 1251 states and 2618 transitions. [2019-12-27 21:39:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:22,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:39:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:22,276 INFO L225 Difference]: With dead ends: 1251 [2019-12-27 21:39:22,276 INFO L226 Difference]: Without dead ends: 1251 [2019-12-27 21:39:22,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-27 21:39:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 929. [2019-12-27 21:39:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-12-27 21:39:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1984 transitions. [2019-12-27 21:39:22,298 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1984 transitions. Word has length 51 [2019-12-27 21:39:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:22,298 INFO L462 AbstractCegarLoop]: Abstraction has 929 states and 1984 transitions. [2019-12-27 21:39:22,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1984 transitions. [2019-12-27 21:39:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:39:22,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:22,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:22,302 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1315298730, now seen corresponding path program 1 times [2019-12-27 21:39:22,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:22,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281441092] [2019-12-27 21:39:22,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281441092] [2019-12-27 21:39:22,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:22,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:22,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587246693] [2019-12-27 21:39:22,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:22,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:22,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:39:22,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:22,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:39:22,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:39:22,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:39:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:39:22,598 INFO L87 Difference]: Start difference. First operand 929 states and 1984 transitions. Second operand 10 states. [2019-12-27 21:39:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:22,917 INFO L93 Difference]: Finished difference Result 1587 states and 3308 transitions. [2019-12-27 21:39:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:39:22,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 21:39:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:22,920 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 21:39:22,920 INFO L226 Difference]: Without dead ends: 1057 [2019-12-27 21:39:22,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-27 21:39:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 928. [2019-12-27 21:39:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-27 21:39:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1962 transitions. [2019-12-27 21:39:22,936 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1962 transitions. Word has length 51 [2019-12-27 21:39:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:22,936 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1962 transitions. [2019-12-27 21:39:22,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:39:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1962 transitions. [2019-12-27 21:39:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:39:22,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:22,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:22,939 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 619071112, now seen corresponding path program 2 times [2019-12-27 21:39:22,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:22,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253605129] [2019-12-27 21:39:22,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:23,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253605129] [2019-12-27 21:39:23,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:23,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:39:23,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [162973847] [2019-12-27 21:39:23,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:23,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:23,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 91 transitions. [2019-12-27 21:39:23,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:23,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:23,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:39:23,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:39:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:23,141 INFO L87 Difference]: Start difference. First operand 928 states and 1962 transitions. Second operand 8 states. [2019-12-27 21:39:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:23,926 INFO L93 Difference]: Finished difference Result 1218 states and 2531 transitions. [2019-12-27 21:39:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:39:23,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 21:39:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:23,929 INFO L225 Difference]: With dead ends: 1218 [2019-12-27 21:39:23,929 INFO L226 Difference]: Without dead ends: 1218 [2019-12-27 21:39:23,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:39:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-12-27 21:39:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 958. [2019-12-27 21:39:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-12-27 21:39:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 2017 transitions. [2019-12-27 21:39:23,945 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 2017 transitions. Word has length 51 [2019-12-27 21:39:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:23,946 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 2017 transitions. [2019-12-27 21:39:23,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:39:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 2017 transitions. [2019-12-27 21:39:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:39:23,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:23,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:23,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash 97638936, now seen corresponding path program 3 times [2019-12-27 21:39:23,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:23,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446261858] [2019-12-27 21:39:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:24,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446261858] [2019-12-27 21:39:24,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:24,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:24,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513397220] [2019-12-27 21:39:24,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:24,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:24,087 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 124 transitions. [2019-12-27 21:39:24,087 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:24,088 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:24,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:24,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:24,089 INFO L87 Difference]: Start difference. First operand 958 states and 2017 transitions. Second operand 3 states. [2019-12-27 21:39:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:24,156 INFO L93 Difference]: Finished difference Result 1193 states and 2498 transitions. [2019-12-27 21:39:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:24,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:39:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:24,159 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 21:39:24,159 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 21:39:24,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 21:39:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 953. [2019-12-27 21:39:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-27 21:39:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2026 transitions. [2019-12-27 21:39:24,180 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2026 transitions. Word has length 51 [2019-12-27 21:39:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:24,180 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2026 transitions. [2019-12-27 21:39:24,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2026 transitions. [2019-12-27 21:39:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:24,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:24,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:24,184 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash 471151996, now seen corresponding path program 1 times [2019-12-27 21:39:24,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:24,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432710133] [2019-12-27 21:39:24,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:24,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432710133] [2019-12-27 21:39:24,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:24,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:39:24,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664506387] [2019-12-27 21:39:24,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:24,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:24,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 92 transitions. [2019-12-27 21:39:24,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:24,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:24,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:39:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:39:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:39:24,492 INFO L87 Difference]: Start difference. First operand 953 states and 2026 transitions. Second operand 9 states. [2019-12-27 21:39:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:25,454 INFO L93 Difference]: Finished difference Result 1277 states and 2626 transitions. [2019-12-27 21:39:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:39:25,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 21:39:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:25,456 INFO L225 Difference]: With dead ends: 1277 [2019-12-27 21:39:25,456 INFO L226 Difference]: Without dead ends: 1277 [2019-12-27 21:39:25,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-12-27 21:39:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1043. [2019-12-27 21:39:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 21:39:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2197 transitions. [2019-12-27 21:39:25,475 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2197 transitions. Word has length 52 [2019-12-27 21:39:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:25,475 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2197 transitions. [2019-12-27 21:39:25,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:39:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2197 transitions. [2019-12-27 21:39:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:25,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:25,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:25,478 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1785491348, now seen corresponding path program 2 times [2019-12-27 21:39:25,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:25,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289336697] [2019-12-27 21:39:25,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:25,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289336697] [2019-12-27 21:39:25,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:25,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:25,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440626998] [2019-12-27 21:39:25,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:25,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:25,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 126 transitions. [2019-12-27 21:39:25,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:25,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:25,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:25,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:25,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:25,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:25,654 INFO L87 Difference]: Start difference. First operand 1043 states and 2197 transitions. Second operand 3 states. [2019-12-27 21:39:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:25,670 INFO L93 Difference]: Finished difference Result 1043 states and 2196 transitions. [2019-12-27 21:39:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:25,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:25,673 INFO L225 Difference]: With dead ends: 1043 [2019-12-27 21:39:25,673 INFO L226 Difference]: Without dead ends: 1043 [2019-12-27 21:39:25,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-27 21:39:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 847. [2019-12-27 21:39:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-27 21:39:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1826 transitions. [2019-12-27 21:39:25,693 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1826 transitions. Word has length 52 [2019-12-27 21:39:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:25,694 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1826 transitions. [2019-12-27 21:39:25,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1826 transitions. [2019-12-27 21:39:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:25,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:25,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:25,697 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:25,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-27 21:39:25,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:25,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145778281] [2019-12-27 21:39:25,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:25,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:39:25,858 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:39:25,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1445~0.base_22|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1445~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1445~0.base_22|) |v_ULTIMATE.start_main_~#t1445~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~y$flush_delayed~0_13) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_22| 1)) (= v_~y$r_buff0_thd1~0_29 0) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (= |v_ULTIMATE.start_main_~#t1445~0.offset_17| 0) (= 0 |v_#NULL.base_3|) (= v_~y$mem_tmp~0_10 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1445~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_22|) 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ~y~0=v_~y~0_25, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:39:25,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-12-27 21:39:25,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= ~y$r_buff0_thd0~0_In950538391 ~y$r_buff1_thd0~0_Out950538391) (= ~y$r_buff0_thd1~0_In950538391 ~y$r_buff1_thd1~0_Out950538391) (= ~y$r_buff1_thd2~0_Out950538391 ~y$r_buff0_thd2~0_In950538391) (= 1 ~x~0_Out950538391) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In950538391)) (= ~y$r_buff0_thd1~0_Out950538391 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In950538391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In950538391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In950538391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In950538391} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out950538391, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out950538391, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In950538391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out950538391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In950538391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In950538391, ~x~0=~x~0_Out950538391, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out950538391} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:39:25,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1046795403 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1046795403 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1046795403| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1046795403| ~y$w_buff0_used~0_In-1046795403)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1046795403, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1046795403} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1046795403|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1046795403, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1046795403} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:39:25,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In68411893 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In68411893 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In68411893 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In68411893 256) 0)) (= (mod ~y$w_buff0_used~0_In68411893 256) 0))) (= ~y$w_buff0~0_In68411893 |P1Thread1of1ForFork1_#t~ite14_Out68411893|) (= |P1Thread1of1ForFork1_#t~ite15_Out68411893| |P1Thread1of1ForFork1_#t~ite14_Out68411893|) .cse1) (and (= ~y$w_buff0~0_In68411893 |P1Thread1of1ForFork1_#t~ite15_Out68411893|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In68411893| |P1Thread1of1ForFork1_#t~ite14_Out68411893|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In68411893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68411893, ~y$w_buff0~0=~y$w_buff0~0_In68411893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68411893, ~weak$$choice2~0=~weak$$choice2~0_In68411893, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In68411893|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68411893} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In68411893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68411893, ~y$w_buff0~0=~y$w_buff0~0_In68411893, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68411893, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out68411893|, ~weak$$choice2~0=~weak$$choice2~0_In68411893, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out68411893|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68411893} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:39:25,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1397368298 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1397368298| ~y$w_buff0_used~0_In-1397368298) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1397368298 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1397368298 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1397368298 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1397368298 256) 0))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1397368298| |P1Thread1of1ForFork1_#t~ite20_Out-1397368298|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1397368298| |P1Thread1of1ForFork1_#t~ite20_Out-1397368298|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1397368298| ~y$w_buff0_used~0_In-1397368298) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397368298, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397368298, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1397368298|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397368298, ~weak$$choice2~0=~weak$$choice2~0_In-1397368298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397368298} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1397368298, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1397368298, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1397368298|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1397368298, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1397368298|, ~weak$$choice2~0=~weak$$choice2~0_In-1397368298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1397368298} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:39:25,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:39:25,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2003438559 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In2003438559| |P1Thread1of1ForFork1_#t~ite29_Out2003438559|) (= ~y$r_buff1_thd2~0_In2003438559 |P1Thread1of1ForFork1_#t~ite30_Out2003438559|) (not .cse0)) (and (= ~y$r_buff1_thd2~0_In2003438559 |P1Thread1of1ForFork1_#t~ite29_Out2003438559|) (= |P1Thread1of1ForFork1_#t~ite30_Out2003438559| |P1Thread1of1ForFork1_#t~ite29_Out2003438559|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2003438559 256)))) (or (= (mod ~y$w_buff0_used~0_In2003438559 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In2003438559 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In2003438559 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2003438559, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2003438559|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2003438559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003438559, ~weak$$choice2~0=~weak$$choice2~0_In2003438559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003438559} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2003438559, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2003438559|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2003438559|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2003438559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003438559, ~weak$$choice2~0=~weak$$choice2~0_In2003438559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003438559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:39:25,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 21:39:25,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-791422527 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-791422527 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-791422527| |P1Thread1of1ForFork1_#t~ite32_Out-791422527|))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-791422527 |P1Thread1of1ForFork1_#t~ite32_Out-791422527|)) (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff1~0_In-791422527 |P1Thread1of1ForFork1_#t~ite32_Out-791422527|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-791422527, ~y$w_buff1~0=~y$w_buff1~0_In-791422527, ~y~0=~y~0_In-791422527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-791422527} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-791422527, ~y$w_buff1~0=~y$w_buff1~0_In-791422527, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-791422527|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-791422527|, ~y~0=~y~0_In-791422527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-791422527} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 21:39:25,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-578267305 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-578267305 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-578267305| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-578267305| ~y$w_buff0_used~0_In-578267305)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-578267305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-578267305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-578267305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-578267305, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-578267305|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:39:25,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In440194167 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In440194167 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In440194167 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In440194167 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out440194167|)) (and (= ~y$w_buff1_used~0_In440194167 |P1Thread1of1ForFork1_#t~ite35_Out440194167|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In440194167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440194167, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In440194167, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440194167} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In440194167, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440194167, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In440194167, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out440194167|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440194167} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:39:25,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In131241798 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In131241798 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out131241798|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In131241798 |P1Thread1of1ForFork1_#t~ite36_Out131241798|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In131241798, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131241798} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In131241798, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131241798, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out131241798|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:39:25,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In531764781 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In531764781 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In531764781 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In531764781 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In531764781 |P1Thread1of1ForFork1_#t~ite37_Out531764781|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out531764781|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In531764781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In531764781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In531764781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In531764781} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In531764781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In531764781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In531764781, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out531764781|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In531764781} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:39:25,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:39:25,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1050678241 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1050678241 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1050678241 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1050678241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1050678241|)) (and (= ~y$w_buff1_used~0_In1050678241 |P0Thread1of1ForFork0_#t~ite6_Out1050678241|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1050678241, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050678241, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1050678241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050678241} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1050678241|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1050678241, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1050678241, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1050678241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1050678241} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:39:25,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-333240787 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-333240787 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-333240787 0)) (and (= ~y$r_buff0_thd1~0_Out-333240787 ~y$r_buff0_thd1~0_In-333240787) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-333240787, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-333240787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-333240787, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-333240787|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-333240787} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:39:25,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-698689751 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-698689751 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-698689751 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-698689751 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-698689751 |P0Thread1of1ForFork0_#t~ite8_Out-698689751|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-698689751|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-698689751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-698689751, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-698689751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698689751} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-698689751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-698689751, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-698689751|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-698689751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698689751} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:39:25,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:39:25,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:39:25,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite41_Out13667304| |ULTIMATE.start_main_#t~ite40_Out13667304|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In13667304 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In13667304 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite40_Out13667304| ~y$w_buff1~0_In13667304)) (and (= |ULTIMATE.start_main_#t~ite40_Out13667304| ~y~0_In13667304) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In13667304, ~y~0=~y~0_In13667304, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In13667304, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13667304} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out13667304|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out13667304|, ~y$w_buff1~0=~y$w_buff1~0_In13667304, ~y~0=~y~0_In13667304, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In13667304, ~y$w_buff1_used~0=~y$w_buff1_used~0_In13667304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:39:25,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2065961938 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2065961938 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2065961938 |ULTIMATE.start_main_#t~ite42_Out2065961938|)) (and (= |ULTIMATE.start_main_#t~ite42_Out2065961938| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2065961938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2065961938} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2065961938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2065961938, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2065961938|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:39:25,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-431988327 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-431988327 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-431988327 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-431988327 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-431988327| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-431988327| ~y$w_buff1_used~0_In-431988327) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-431988327, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-431988327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-431988327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431988327} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-431988327, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-431988327, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-431988327|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-431988327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431988327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:39:25,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In206608782 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In206608782 256)))) (or (and (= ~y$r_buff0_thd0~0_In206608782 |ULTIMATE.start_main_#t~ite44_Out206608782|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out206608782|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In206608782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In206608782} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In206608782, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In206608782, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out206608782|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:39:25,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In508219821 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In508219821 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In508219821 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In508219821 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out508219821|)) (and (= ~y$r_buff1_thd0~0_In508219821 |ULTIMATE.start_main_#t~ite45_Out508219821|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In508219821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In508219821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In508219821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508219821} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In508219821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In508219821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In508219821, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out508219821|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508219821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:39:25,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:39:25,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:25 BasicIcfg [2019-12-27 21:39:25,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:39:25,990 INFO L168 Benchmark]: Toolchain (without parser) took 18250.95 ms. Allocated memory was 144.2 MB in the beginning and 775.9 MB in the end (delta: 631.8 MB). Free memory was 100.4 MB in the beginning and 295.4 MB in the end (delta: -194.9 MB). Peak memory consumption was 436.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,991 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.56 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 154.5 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.74 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,993 INFO L168 Benchmark]: Boogie Preprocessor took 44.10 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,993 INFO L168 Benchmark]: RCFGBuilder took 746.63 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 105.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,994 INFO L168 Benchmark]: TraceAbstraction took 16554.51 ms. Allocated memory was 202.4 MB in the beginning and 775.9 MB in the end (delta: 573.6 MB). Free memory was 105.3 MB in the beginning and 295.4 MB in the end (delta: -190.1 MB). Peak memory consumption was 383.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:25,999 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.27 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.56 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 154.5 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.74 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.10 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.63 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 105.3 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16554.51 ms. Allocated memory was 202.4 MB in the beginning and 775.9 MB in the end (delta: 573.6 MB). Free memory was 105.3 MB in the beginning and 295.4 MB in the end (delta: -190.1 MB). Peak memory consumption was 383.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1868 SDtfs, 1764 SDslu, 4605 SDs, 0 SdLazy, 3056 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 6653 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 52019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...