/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:31:23,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:31:23,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:31:23,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:31:23,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:31:23,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:31:23,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:31:23,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:31:23,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:31:23,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:31:23,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:31:23,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:31:23,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:31:23,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:31:23,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:31:23,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:31:23,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:31:23,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:31:23,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:31:23,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:31:23,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:31:23,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:31:23,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:31:23,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:31:23,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:31:23,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:31:23,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:31:23,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:31:23,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:31:23,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:31:23,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:31:23,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:31:23,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:31:23,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:31:23,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:31:23,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:31:23,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:31:23,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:31:23,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:31:23,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:31:23,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:31:23,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:31:23,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:31:23,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:31:23,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:31:23,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:31:23,121 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:31:23,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:31:23,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:31:23,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:31:23,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:31:23,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:31:23,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:31:23,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:31:23,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:31:23,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:31:23,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:31:23,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:31:23,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:31:23,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:31:23,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:31:23,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:31:23,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:31:23,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:31:23,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:31:23,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:31:23,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:31:23,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:31:23,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:31:23,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:31:23,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:31:23,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:31:23,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:31:23,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:31:23,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:31:23,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:31:23,417 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:31:23,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-18 22:31:23,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad01c312/aa49d5ff570c44dc8d020fd6d0699aa0/FLAGf3209ff90 [2019-12-18 22:31:23,978 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:31:23,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-18 22:31:24,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad01c312/aa49d5ff570c44dc8d020fd6d0699aa0/FLAGf3209ff90 [2019-12-18 22:31:24,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad01c312/aa49d5ff570c44dc8d020fd6d0699aa0 [2019-12-18 22:31:24,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:31:24,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:31:24,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:24,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:31:24,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:31:24,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:24, skipping insertion in model container [2019-12-18 22:31:24,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:24" (1/1) ... [2019-12-18 22:31:24,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:31:24,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:31:24,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:24,974 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:31:25,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:25,115 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:31:25,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25 WrapperNode [2019-12-18 22:31:25,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:25,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:25,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:31:25,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:31:25,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:25,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:31:25,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:31:25,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:31:25,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... [2019-12-18 22:31:25,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:31:25,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:31:25,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:31:25,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:31:25,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:31:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:31:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:31:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:31:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:31:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:31:25,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:31:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:31:25,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:31:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:31:25,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:31:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:31:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:31:25,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:31:25,338 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:31:26,134 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:31:26,135 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:31:26,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:26 BoogieIcfgContainer [2019-12-18 22:31:26,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:31:26,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:31:26,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:31:26,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:31:26,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:31:24" (1/3) ... [2019-12-18 22:31:26,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4091d05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:26, skipping insertion in model container [2019-12-18 22:31:26,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:25" (2/3) ... [2019-12-18 22:31:26,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4091d05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:26, skipping insertion in model container [2019-12-18 22:31:26,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:26" (3/3) ... [2019-12-18 22:31:26,144 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2019-12-18 22:31:26,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:31:26,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:31:26,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:31:26,161 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:31:26,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,277 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,277 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:26,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:31:26,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:31:26,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:31:26,319 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:31:26,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:31:26,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:31:26,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:31:26,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:31:26,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:31:26,340 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:31:26,342 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:26,436 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:26,437 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:26,457 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:26,481 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:26,559 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:26,560 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:26,567 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:26,587 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:31:26,588 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:31:29,788 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:31:29,909 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:31:29,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81758 [2019-12-18 22:31:29,938 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:31:29,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:31:47,730 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117812 states. [2019-12-18 22:31:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states. [2019-12-18 22:31:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:31:47,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:31:47,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:31:47,744 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:31:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:31:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 839664, now seen corresponding path program 1 times [2019-12-18 22:31:47,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:31:47,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103570790] [2019-12-18 22:31:47,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:31:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:31:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:31:48,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103570790] [2019-12-18 22:31:48,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:31:48,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:31:48,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460629856] [2019-12-18 22:31:48,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:31:48,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:31:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:31:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:31:48,020 INFO L87 Difference]: Start difference. First operand 117812 states. Second operand 3 states. [2019-12-18 22:31:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:31:51,518 INFO L93 Difference]: Finished difference Result 117510 states and 507540 transitions. [2019-12-18 22:31:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:31:51,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:31:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:31:52,276 INFO L225 Difference]: With dead ends: 117510 [2019-12-18 22:31:52,277 INFO L226 Difference]: Without dead ends: 115144 [2019-12-18 22:31:52,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:31:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115144 states. [2019-12-18 22:31:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115144 to 115144. [2019-12-18 22:31:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115144 states. [2019-12-18 22:32:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115144 states to 115144 states and 497894 transitions. [2019-12-18 22:32:04,540 INFO L78 Accepts]: Start accepts. Automaton has 115144 states and 497894 transitions. Word has length 3 [2019-12-18 22:32:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:04,541 INFO L462 AbstractCegarLoop]: Abstraction has 115144 states and 497894 transitions. [2019-12-18 22:32:04,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 115144 states and 497894 transitions. [2019-12-18 22:32:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:32:04,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:04,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:04,547 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -79799111, now seen corresponding path program 1 times [2019-12-18 22:32:04,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:04,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538392158] [2019-12-18 22:32:04,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:04,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538392158] [2019-12-18 22:32:04,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:04,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:04,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958297688] [2019-12-18 22:32:04,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:04,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:04,656 INFO L87 Difference]: Start difference. First operand 115144 states and 497894 transitions. Second operand 4 states. [2019-12-18 22:32:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:06,195 INFO L93 Difference]: Finished difference Result 185114 states and 767412 transitions. [2019-12-18 22:32:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:06,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:32:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:12,396 INFO L225 Difference]: With dead ends: 185114 [2019-12-18 22:32:12,396 INFO L226 Difference]: Without dead ends: 185065 [2019-12-18 22:32:12,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185065 states. [2019-12-18 22:32:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185065 to 169989. [2019-12-18 22:32:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169989 states. [2019-12-18 22:32:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 713980 transitions. [2019-12-18 22:32:21,540 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 713980 transitions. Word has length 11 [2019-12-18 22:32:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:21,541 INFO L462 AbstractCegarLoop]: Abstraction has 169989 states and 713980 transitions. [2019-12-18 22:32:21,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 713980 transitions. [2019-12-18 22:32:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:32:21,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:21,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:21,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash -676042940, now seen corresponding path program 1 times [2019-12-18 22:32:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:21,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186988041] [2019-12-18 22:32:21,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:21,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186988041] [2019-12-18 22:32:21,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:21,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:21,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670076380] [2019-12-18 22:32:21,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:21,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:21,693 INFO L87 Difference]: Start difference. First operand 169989 states and 713980 transitions. Second operand 4 states. [2019-12-18 22:32:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:29,651 INFO L93 Difference]: Finished difference Result 241878 states and 992054 transitions. [2019-12-18 22:32:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:29,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:32:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:30,374 INFO L225 Difference]: With dead ends: 241878 [2019-12-18 22:32:30,375 INFO L226 Difference]: Without dead ends: 241815 [2019-12-18 22:32:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-12-18 22:32:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 205075. [2019-12-18 22:32:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205075 states. [2019-12-18 22:32:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205075 states to 205075 states and 855408 transitions. [2019-12-18 22:32:41,379 INFO L78 Accepts]: Start accepts. Automaton has 205075 states and 855408 transitions. Word has length 13 [2019-12-18 22:32:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:41,380 INFO L462 AbstractCegarLoop]: Abstraction has 205075 states and 855408 transitions. [2019-12-18 22:32:41,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 205075 states and 855408 transitions. [2019-12-18 22:32:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:32:41,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:41,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:41,384 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1689712693, now seen corresponding path program 1 times [2019-12-18 22:32:41,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:41,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438738842] [2019-12-18 22:32:41,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:41,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438738842] [2019-12-18 22:32:41,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:41,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:41,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260820142] [2019-12-18 22:32:41,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:41,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:41,444 INFO L87 Difference]: Start difference. First operand 205075 states and 855408 transitions. Second operand 3 states. [2019-12-18 22:32:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:41,589 INFO L93 Difference]: Finished difference Result 40406 states and 132180 transitions. [2019-12-18 22:32:41,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:41,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:32:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:41,650 INFO L225 Difference]: With dead ends: 40406 [2019-12-18 22:32:41,651 INFO L226 Difference]: Without dead ends: 40406 [2019-12-18 22:32:41,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40406 states. [2019-12-18 22:32:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40406 to 40406. [2019-12-18 22:32:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40406 states. [2019-12-18 22:32:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40406 states to 40406 states and 132180 transitions. [2019-12-18 22:32:48,660 INFO L78 Accepts]: Start accepts. Automaton has 40406 states and 132180 transitions. Word has length 13 [2019-12-18 22:32:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:48,660 INFO L462 AbstractCegarLoop]: Abstraction has 40406 states and 132180 transitions. [2019-12-18 22:32:48,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40406 states and 132180 transitions. [2019-12-18 22:32:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:32:48,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:48,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:48,668 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1531561803, now seen corresponding path program 1 times [2019-12-18 22:32:48,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:48,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385003311] [2019-12-18 22:32:48,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:48,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385003311] [2019-12-18 22:32:48,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:48,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:48,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312953639] [2019-12-18 22:32:48,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:48,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:48,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:48,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:48,882 INFO L87 Difference]: Start difference. First operand 40406 states and 132180 transitions. Second operand 5 states. [2019-12-18 22:32:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:49,790 INFO L93 Difference]: Finished difference Result 54550 states and 174566 transitions. [2019-12-18 22:32:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:32:49,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:32:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:49,876 INFO L225 Difference]: With dead ends: 54550 [2019-12-18 22:32:49,877 INFO L226 Difference]: Without dead ends: 54537 [2019-12-18 22:32:49,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:32:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2019-12-18 22:32:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 40777. [2019-12-18 22:32:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40777 states. [2019-12-18 22:32:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 133064 transitions. [2019-12-18 22:32:51,006 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 133064 transitions. Word has length 19 [2019-12-18 22:32:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:51,006 INFO L462 AbstractCegarLoop]: Abstraction has 40777 states and 133064 transitions. [2019-12-18 22:32:51,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 133064 transitions. [2019-12-18 22:32:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:32:51,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:51,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:51,020 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1034032563, now seen corresponding path program 1 times [2019-12-18 22:32:51,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:51,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722655703] [2019-12-18 22:32:51,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:51,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722655703] [2019-12-18 22:32:51,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:51,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:51,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971714752] [2019-12-18 22:32:51,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:51,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:51,084 INFO L87 Difference]: Start difference. First operand 40777 states and 133064 transitions. Second operand 4 states. [2019-12-18 22:32:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:51,124 INFO L93 Difference]: Finished difference Result 7638 states and 20735 transitions. [2019-12-18 22:32:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:32:51,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:32:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:51,135 INFO L225 Difference]: With dead ends: 7638 [2019-12-18 22:32:51,135 INFO L226 Difference]: Without dead ends: 7638 [2019-12-18 22:32:51,136 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-18 22:32:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-18 22:32:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7498. [2019-12-18 22:32:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-18 22:32:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 20363 transitions. [2019-12-18 22:32:51,227 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 20363 transitions. Word has length 25 [2019-12-18 22:32:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:51,227 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 20363 transitions. [2019-12-18 22:32:51,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 20363 transitions. [2019-12-18 22:32:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:32:51,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:51,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:51,239 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2065802623, now seen corresponding path program 1 times [2019-12-18 22:32:51,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:51,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096474402] [2019-12-18 22:32:51,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:51,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096474402] [2019-12-18 22:32:51,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:51,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:32:51,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7285018] [2019-12-18 22:32:51,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:51,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:51,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:51,311 INFO L87 Difference]: Start difference. First operand 7498 states and 20363 transitions. Second operand 5 states. [2019-12-18 22:32:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:51,349 INFO L93 Difference]: Finished difference Result 5405 states and 15353 transitions. [2019-12-18 22:32:51,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:51,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:32:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:51,356 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 22:32:51,356 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:32:51,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:32:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:32:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:32:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13441 transitions. [2019-12-18 22:32:51,416 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13441 transitions. Word has length 37 [2019-12-18 22:32:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:51,417 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13441 transitions. [2019-12-18 22:32:51,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13441 transitions. [2019-12-18 22:32:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:51,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:51,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:51,425 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1806952947, now seen corresponding path program 1 times [2019-12-18 22:32:51,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:51,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776809640] [2019-12-18 22:32:51,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:51,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776809640] [2019-12-18 22:32:51,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:51,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:51,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539680018] [2019-12-18 22:32:51,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:51,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:51,501 INFO L87 Difference]: Start difference. First operand 4661 states and 13441 transitions. Second operand 3 states. [2019-12-18 22:32:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:51,560 INFO L93 Difference]: Finished difference Result 4670 states and 13455 transitions. [2019-12-18 22:32:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:51,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:32:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:51,568 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:32:51,568 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:32:51,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:32:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:32:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:32:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13451 transitions. [2019-12-18 22:32:51,649 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13451 transitions. Word has length 65 [2019-12-18 22:32:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:51,649 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13451 transitions. [2019-12-18 22:32:51,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13451 transitions. [2019-12-18 22:32:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:51,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:51,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:51,659 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -736030129, now seen corresponding path program 1 times [2019-12-18 22:32:51,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:51,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235350005] [2019-12-18 22:32:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:51,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235350005] [2019-12-18 22:32:51,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:51,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:32:51,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356881633] [2019-12-18 22:32:51,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:51,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:51,727 INFO L87 Difference]: Start difference. First operand 4666 states and 13451 transitions. Second operand 3 states. [2019-12-18 22:32:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:51,779 INFO L93 Difference]: Finished difference Result 4670 states and 13445 transitions. [2019-12-18 22:32:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:51,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:32:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:51,787 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:32:51,787 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:32:51,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:32:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:32:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:32:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13441 transitions. [2019-12-18 22:32:51,847 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13441 transitions. Word has length 65 [2019-12-18 22:32:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:51,848 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13441 transitions. [2019-12-18 22:32:51,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13441 transitions. [2019-12-18 22:32:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:51,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:51,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:51,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:51,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash -743654703, now seen corresponding path program 1 times [2019-12-18 22:32:51,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:51,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329678313] [2019-12-18 22:32:51,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:51,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329678313] [2019-12-18 22:32:51,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:51,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:32:51,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774404964] [2019-12-18 22:32:51,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:51,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:51,961 INFO L87 Difference]: Start difference. First operand 4666 states and 13441 transitions. Second operand 5 states. [2019-12-18 22:32:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:52,272 INFO L93 Difference]: Finished difference Result 7090 states and 20230 transitions. [2019-12-18 22:32:52,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:32:52,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:32:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:52,284 INFO L225 Difference]: With dead ends: 7090 [2019-12-18 22:32:52,285 INFO L226 Difference]: Without dead ends: 7090 [2019-12-18 22:32:52,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:32:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-18 22:32:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5981. [2019-12-18 22:32:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5981 states. [2019-12-18 22:32:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 17235 transitions. [2019-12-18 22:32:52,416 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 17235 transitions. Word has length 65 [2019-12-18 22:32:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:52,417 INFO L462 AbstractCegarLoop]: Abstraction has 5981 states and 17235 transitions. [2019-12-18 22:32:52,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 17235 transitions. [2019-12-18 22:32:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:52,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:52,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:52,429 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 326503145, now seen corresponding path program 2 times [2019-12-18 22:32:52,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:52,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942207911] [2019-12-18 22:32:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:52,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942207911] [2019-12-18 22:32:52,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:52,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:32:52,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826046692] [2019-12-18 22:32:52,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:32:52,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:32:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:52,544 INFO L87 Difference]: Start difference. First operand 5981 states and 17235 transitions. Second operand 5 states. [2019-12-18 22:32:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:52,887 INFO L93 Difference]: Finished difference Result 9069 states and 25840 transitions. [2019-12-18 22:32:52,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:32:52,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:32:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:52,899 INFO L225 Difference]: With dead ends: 9069 [2019-12-18 22:32:52,899 INFO L226 Difference]: Without dead ends: 9069 [2019-12-18 22:32:52,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:32:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-12-18 22:32:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 6733. [2019-12-18 22:32:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-12-18 22:32:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 19502 transitions. [2019-12-18 22:32:53,012 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 19502 transitions. Word has length 65 [2019-12-18 22:32:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:53,012 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 19502 transitions. [2019-12-18 22:32:53,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:32:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 19502 transitions. [2019-12-18 22:32:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:53,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:53,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:53,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 737396099, now seen corresponding path program 3 times [2019-12-18 22:32:53,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:53,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474545548] [2019-12-18 22:32:53,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:53,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474545548] [2019-12-18 22:32:53,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:53,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:32:53,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842237871] [2019-12-18 22:32:53,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:32:53,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:32:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:32:53,325 INFO L87 Difference]: Start difference. First operand 6733 states and 19502 transitions. Second operand 6 states. [2019-12-18 22:32:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:53,843 INFO L93 Difference]: Finished difference Result 10887 states and 31295 transitions. [2019-12-18 22:32:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:32:53,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:32:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:53,859 INFO L225 Difference]: With dead ends: 10887 [2019-12-18 22:32:53,860 INFO L226 Difference]: Without dead ends: 10887 [2019-12-18 22:32:53,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:32:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-18 22:32:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7256. [2019-12-18 22:32:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-18 22:32:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 21081 transitions. [2019-12-18 22:32:53,989 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 21081 transitions. Word has length 65 [2019-12-18 22:32:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:53,989 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 21081 transitions. [2019-12-18 22:32:53,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:32:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 21081 transitions. [2019-12-18 22:32:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:32:54,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:54,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:54,000 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 156309423, now seen corresponding path program 4 times [2019-12-18 22:32:54,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:54,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286632016] [2019-12-18 22:32:54,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:54,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286632016] [2019-12-18 22:32:54,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:54,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:54,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565739882] [2019-12-18 22:32:54,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:54,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:54,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:54,151 INFO L87 Difference]: Start difference. First operand 7256 states and 21081 transitions. Second operand 3 states. [2019-12-18 22:32:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:54,239 INFO L93 Difference]: Finished difference Result 7256 states and 21080 transitions. [2019-12-18 22:32:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:54,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:32:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:54,253 INFO L225 Difference]: With dead ends: 7256 [2019-12-18 22:32:54,254 INFO L226 Difference]: Without dead ends: 7256 [2019-12-18 22:32:54,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-18 22:32:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 4657. [2019-12-18 22:32:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-18 22:32:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 13801 transitions. [2019-12-18 22:32:54,380 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 13801 transitions. Word has length 65 [2019-12-18 22:32:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:54,380 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 13801 transitions. [2019-12-18 22:32:54,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 13801 transitions. [2019-12-18 22:32:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:32:54,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:54,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:54,390 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 939416227, now seen corresponding path program 1 times [2019-12-18 22:32:54,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:54,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450988911] [2019-12-18 22:32:54,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:54,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450988911] [2019-12-18 22:32:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:54,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:54,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288482514] [2019-12-18 22:32:54,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:54,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:54,455 INFO L87 Difference]: Start difference. First operand 4657 states and 13801 transitions. Second operand 3 states. [2019-12-18 22:32:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:54,481 INFO L93 Difference]: Finished difference Result 4277 states and 12382 transitions. [2019-12-18 22:32:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:54,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:32:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:54,489 INFO L225 Difference]: With dead ends: 4277 [2019-12-18 22:32:54,489 INFO L226 Difference]: Without dead ends: 4277 [2019-12-18 22:32:54,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2019-12-18 22:32:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 3561. [2019-12-18 22:32:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-18 22:32:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-18 22:32:54,569 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 66 [2019-12-18 22:32:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:54,570 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-18 22:32:54,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-18 22:32:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:32:54,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:54,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:54,579 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -9053315, now seen corresponding path program 1 times [2019-12-18 22:32:54,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:54,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3217183] [2019-12-18 22:32:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:54,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3217183] [2019-12-18 22:32:54,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:54,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:32:54,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693892298] [2019-12-18 22:32:54,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:32:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:32:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:32:54,741 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 6 states. [2019-12-18 22:32:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:55,264 INFO L93 Difference]: Finished difference Result 6091 states and 17309 transitions. [2019-12-18 22:32:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:32:55,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:32:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:55,274 INFO L225 Difference]: With dead ends: 6091 [2019-12-18 22:32:55,274 INFO L226 Difference]: Without dead ends: 6091 [2019-12-18 22:32:55,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:32:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2019-12-18 22:32:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3561. [2019-12-18 22:32:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-12-18 22:32:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 10350 transitions. [2019-12-18 22:32:55,338 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 10350 transitions. Word has length 67 [2019-12-18 22:32:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:55,338 INFO L462 AbstractCegarLoop]: Abstraction has 3561 states and 10350 transitions. [2019-12-18 22:32:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:32:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 10350 transitions. [2019-12-18 22:32:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:32:55,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:55,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:55,344 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash -631043911, now seen corresponding path program 2 times [2019-12-18 22:32:55,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:55,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701519740] [2019-12-18 22:32:55,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:55,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701519740] [2019-12-18 22:32:55,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:55,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:55,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335703220] [2019-12-18 22:32:55,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:55,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:55,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:55,414 INFO L87 Difference]: Start difference. First operand 3561 states and 10350 transitions. Second operand 3 states. [2019-12-18 22:32:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:55,435 INFO L93 Difference]: Finished difference Result 3385 states and 9561 transitions. [2019-12-18 22:32:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:55,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:32:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:55,441 INFO L225 Difference]: With dead ends: 3385 [2019-12-18 22:32:55,441 INFO L226 Difference]: Without dead ends: 3385 [2019-12-18 22:32:55,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-12-18 22:32:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2989. [2019-12-18 22:32:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-18 22:32:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8455 transitions. [2019-12-18 22:32:55,502 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8455 transitions. Word has length 67 [2019-12-18 22:32:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:55,502 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8455 transitions. [2019-12-18 22:32:55,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8455 transitions. [2019-12-18 22:32:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:32:55,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:55,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:55,508 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1113013633, now seen corresponding path program 1 times [2019-12-18 22:32:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:55,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202332348] [2019-12-18 22:32:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:55,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202332348] [2019-12-18 22:32:55,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:55,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:32:55,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141545200] [2019-12-18 22:32:55,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:32:55,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:32:55,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:32:55,693 INFO L87 Difference]: Start difference. First operand 2989 states and 8455 transitions. Second operand 7 states. [2019-12-18 22:32:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:55,793 INFO L93 Difference]: Finished difference Result 6102 states and 17360 transitions. [2019-12-18 22:32:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:32:55,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 22:32:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:55,800 INFO L225 Difference]: With dead ends: 6102 [2019-12-18 22:32:55,800 INFO L226 Difference]: Without dead ends: 3697 [2019-12-18 22:32:55,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:32:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-12-18 22:32:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 2817. [2019-12-18 22:32:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-18 22:32:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7940 transitions. [2019-12-18 22:32:55,849 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7940 transitions. Word has length 68 [2019-12-18 22:32:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:55,849 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7940 transitions. [2019-12-18 22:32:55,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:32:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7940 transitions. [2019-12-18 22:32:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:32:55,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:55,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:55,852 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -539233385, now seen corresponding path program 2 times [2019-12-18 22:32:55,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:55,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912536603] [2019-12-18 22:32:55,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:32:56,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912536603] [2019-12-18 22:32:56,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:56,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:32:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911387323] [2019-12-18 22:32:56,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:32:56,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:32:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:32:56,126 INFO L87 Difference]: Start difference. First operand 2817 states and 7940 transitions. Second operand 14 states. [2019-12-18 22:32:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:56,877 INFO L93 Difference]: Finished difference Result 5022 states and 13962 transitions. [2019-12-18 22:32:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:32:56,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 22:32:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:56,886 INFO L225 Difference]: With dead ends: 5022 [2019-12-18 22:32:56,886 INFO L226 Difference]: Without dead ends: 4990 [2019-12-18 22:32:56,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:32:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4990 states. [2019-12-18 22:32:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4990 to 4069. [2019-12-18 22:32:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-18 22:32:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 11326 transitions. [2019-12-18 22:32:56,964 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 11326 transitions. Word has length 68 [2019-12-18 22:32:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:56,964 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 11326 transitions. [2019-12-18 22:32:56,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:32:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 11326 transitions. [2019-12-18 22:32:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:32:56,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:56,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:56,969 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -691349817, now seen corresponding path program 3 times [2019-12-18 22:32:56,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:56,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873983542] [2019-12-18 22:32:56,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:32:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:32:57,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:32:57,285 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:32:57,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21|) |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$w_buff0_used~0_115 0) (= 0 v_~z$r_buff1_thd0~0_47) (= v_~main$tmp_guard0~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z~0_28 0) (= v_~z$r_buff0_thd3~0_20 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t2031~0.base_21|) (= 0 v_~z$w_buff0~0_27) (= (store .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21| 1) |v_#valid_55|) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_19|) (= |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21|)) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2031~0.base_21| 4)) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2031~0.offset=|v_ULTIMATE.start_main_~#t2031~0.offset_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_~#t2031~0.base=|v_ULTIMATE.start_main_~#t2031~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2032~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2031~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2033~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2032~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2031~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:32:57,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12|) |v_ULTIMATE.start_main_~#t2032~0.offset_11| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2032~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t2032~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2032~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2032~0.offset] because there is no mapped edge [2019-12-18 22:32:57,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_17) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_93 v_~z$w_buff1_used~0_60) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_92 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:32:57,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L807-1-->L809: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9|) |v_ULTIMATE.start_main_~#t2033~0.offset_8| 2))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2033~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2033~0.base_9| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2033~0.base_9|)) (= |v_ULTIMATE.start_main_~#t2033~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_9|, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_~#t2033~0.offset] because there is no mapped edge [2019-12-18 22:32:57,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In568353729 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In568353729 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In568353729 |P0Thread1of1ForFork0_#t~ite5_Out568353729|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out568353729|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In568353729, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In568353729} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out568353729|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In568353729, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In568353729} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:32:57,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In452083013 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In452083013 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In452083013 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In452083013 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out452083013| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out452083013| ~z$w_buff1_used~0_In452083013)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In452083013, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In452083013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452083013, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In452083013} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out452083013|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In452083013, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In452083013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In452083013, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In452083013} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:32:57,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1371129176 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1371129176 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1371129176)) (and (= ~z$r_buff0_thd1~0_Out1371129176 ~z$r_buff0_thd1~0_In1371129176) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1371129176, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1371129176} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1371129176, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1371129176|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1371129176} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:32:57,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1243335670 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1243335670 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1243335670 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1243335670 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1243335670 |P0Thread1of1ForFork0_#t~ite8_Out1243335670|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1243335670|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1243335670, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1243335670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243335670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1243335670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1243335670, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1243335670|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1243335670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1243335670, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1243335670} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:32:57,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:32:57,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2101739129 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2101739129 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-2101739129| |P1Thread1of1ForFork1_#t~ite10_Out-2101739129|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-2101739129| ~z$w_buff1~0_In-2101739129) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-2101739129| ~z~0_In-2101739129) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2101739129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2101739129, ~z$w_buff1~0=~z$w_buff1~0_In-2101739129, ~z~0=~z~0_In-2101739129} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2101739129|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2101739129, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2101739129, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-2101739129|, ~z$w_buff1~0=~z$w_buff1~0_In-2101739129, ~z~0=~z~0_In-2101739129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 22:32:57,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1004003768 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1004003768 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1004003768| ~z$w_buff1~0_In1004003768) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1004003768 |P2Thread1of1ForFork2_#t~ite15_Out1004003768|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1004003768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1004003768, ~z$w_buff1~0=~z$w_buff1~0_In1004003768, ~z~0=~z~0_In1004003768} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1004003768|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1004003768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1004003768, ~z$w_buff1~0=~z$w_buff1~0_In1004003768, ~z~0=~z~0_In1004003768} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:32:57,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_17, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:32:57,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1563665377 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1563665377 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1563665377| ~z$w_buff0_used~0_In-1563665377) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1563665377|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1563665377, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1563665377} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1563665377, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1563665377, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1563665377|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:32:57,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2082014319 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2082014319 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2082014319 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In2082014319 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2082014319 |P2Thread1of1ForFork2_#t~ite18_Out2082014319|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out2082014319|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2082014319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2082014319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2082014319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2082014319} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2082014319, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2082014319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2082014319, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2082014319, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2082014319|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:32:57,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-419138212 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-419138212 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-419138212| ~z$r_buff0_thd3~0_In-419138212) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-419138212| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-419138212, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-419138212} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-419138212, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-419138212, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-419138212|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:32:57,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In488524030 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In488524030 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In488524030 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In488524030 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out488524030| ~z$r_buff1_thd3~0_In488524030) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite20_Out488524030| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In488524030, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In488524030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488524030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In488524030} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In488524030, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out488524030|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In488524030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In488524030, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In488524030} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:32:57,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_13) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:32:57,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1024346004 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1024346004 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1024346004|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1024346004| ~z$w_buff0_used~0_In-1024346004)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024346004, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1024346004} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024346004, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1024346004|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1024346004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:32:57,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1226349716 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1226349716 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1226349716 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1226349716 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1226349716 |P1Thread1of1ForFork1_#t~ite12_Out1226349716|)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1226349716| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1226349716, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1226349716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1226349716, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1226349716} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1226349716, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1226349716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1226349716, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1226349716|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1226349716} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:32:57,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1664023132 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1664023132 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1664023132| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1664023132| ~z$r_buff0_thd2~0_In-1664023132) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664023132, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1664023132} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1664023132, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1664023132|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1664023132} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:32:57,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1457919378 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1457919378 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1457919378 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1457919378 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1457919378| 0)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1457919378 |P1Thread1of1ForFork1_#t~ite14_Out-1457919378|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457919378, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1457919378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1457919378, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1457919378} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1457919378, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1457919378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1457919378, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1457919378|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1457919378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:32:57,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:32:57,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:32:57,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1154464132| |ULTIMATE.start_main_#t~ite25_Out1154464132|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1154464132 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1154464132 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1154464132| ~z$w_buff1~0_In1154464132)) (and (= |ULTIMATE.start_main_#t~ite24_Out1154464132| ~z~0_In1154464132) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1154464132, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1154464132, ~z$w_buff1~0=~z$w_buff1~0_In1154464132, ~z~0=~z~0_In1154464132} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1154464132, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1154464132|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1154464132, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1154464132|, ~z$w_buff1~0=~z$w_buff1~0_In1154464132, ~z~0=~z~0_In1154464132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:32:57,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-943659212 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-943659212 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-943659212| ~z$w_buff0_used~0_In-943659212) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-943659212| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-943659212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943659212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-943659212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943659212, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-943659212|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:32:57,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In961819407 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In961819407 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In961819407 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In961819407 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out961819407|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out961819407| ~z$w_buff1_used~0_In961819407) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961819407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961819407, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961819407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961819407} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In961819407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In961819407, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961819407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961819407, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out961819407|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:32:57,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1921366509 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1921366509 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out1921366509| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1921366509| ~z$r_buff0_thd0~0_In1921366509) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1921366509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921366509} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1921366509, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1921366509|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921366509} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:32:57,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-863332004 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-863332004 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-863332004 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-863332004 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-863332004 |ULTIMATE.start_main_#t~ite29_Out-863332004|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite29_Out-863332004| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-863332004, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-863332004, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-863332004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-863332004} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-863332004, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-863332004|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-863332004, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-863332004, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-863332004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:32:57,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_55 v_~z$r_buff0_thd0~0_54)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_54, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:32:57,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L834-->L837-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:32:57,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:32:57,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:32:57 BasicIcfg [2019-12-18 22:32:57,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:32:57,424 INFO L168 Benchmark]: Toolchain (without parser) took 93116.72 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,424 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.12 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.37 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,428 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,428 INFO L168 Benchmark]: RCFGBuilder took 895.43 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,431 INFO L168 Benchmark]: TraceAbstraction took 91284.79 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 22:32:57,443 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.12 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.37 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 203.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 895.43 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91284.79 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5870 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81758 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2716 SDtfs, 2298 SDslu, 5138 SDs, 0 SdLazy, 2792 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 30 SyntacticMatches, 13 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205075occurred 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: 41.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 81206 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 177441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...