/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/mix041_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:23:31,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:23:31,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:23:31,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:23:31,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:23:31,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:23:31,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:23:31,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:23:31,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:23:31,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:23:31,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:23:31,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:23:31,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:23:31,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:23:31,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:23:31,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:23:31,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:23:31,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:23:31,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:23:31,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:23:31,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:23:31,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:23:31,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:23:31,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:23:31,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:23:31,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:23:31,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:23:31,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:23:31,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:23:31,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:23:31,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:23:31,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:23:31,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:23:31,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:23:31,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:23:31,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:23:31,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:23:31,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:23:31,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:23:31,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:23:31,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:23:31,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:23:31,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:23:31,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:23:31,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:23:31,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:23:31,361 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:23:31,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:23:31,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:23:31,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:23:31,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:23:31,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:23:31,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:23:31,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:23:31,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:23:31,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:23:31,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:23:31,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:23:31,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:23:31,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:23:31,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:23:31,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:23:31,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:23:31,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:23:31,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:23:31,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:23:31,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:23:31,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:23:31,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:23:31,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:23:31,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:23:31,663 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:23:31,664 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-18 21:23:31,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31d75957/4136d04a3e824560bf5964135a2f5fac/FLAGeb5292c34 [2019-12-18 21:23:32,245 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:23:32,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.oepc.i [2019-12-18 21:23:32,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31d75957/4136d04a3e824560bf5964135a2f5fac/FLAGeb5292c34 [2019-12-18 21:23:32,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31d75957/4136d04a3e824560bf5964135a2f5fac [2019-12-18 21:23:32,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:23:32,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:23:32,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:32,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:23:32,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:23:32,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:32" (1/1) ... [2019-12-18 21:23:32,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33785319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:32, skipping insertion in model container [2019-12-18 21:23:32,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:23:32" (1/1) ... [2019-12-18 21:23:32,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:23:32,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:23:33,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:33,091 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:23:33,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:23:33,257 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:23:33,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33 WrapperNode [2019-12-18 21:23:33,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:23:33,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:33,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:23:33,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:23:33,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:23:33,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:23:33,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:23:33,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:23:33,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... [2019-12-18 21:23:33,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:23:33,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:23:33,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:23:33,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:23:33,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:23:33,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:23:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:23:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:23:33,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:23:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:23:33,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:23:33,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:23:33,457 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:23:34,230 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:23:34,231 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:23:34,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:34 BoogieIcfgContainer [2019-12-18 21:23:34,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:23:34,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:23:34,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:23:34,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:23:34,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:23:32" (1/3) ... [2019-12-18 21:23:34,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:34, skipping insertion in model container [2019-12-18 21:23:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:23:33" (2/3) ... [2019-12-18 21:23:34,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9fbfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:23:34, skipping insertion in model container [2019-12-18 21:23:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:23:34" (3/3) ... [2019-12-18 21:23:34,241 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc.i [2019-12-18 21:23:34,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:23:34,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:23:34,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:23:34,261 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:23:34,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:23:34,383 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:23:34,403 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:23:34,403 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:23:34,403 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:23:34,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:23:34,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:23:34,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:23:34,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:23:34,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:23:34,421 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 21:23:34,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:34,512 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:34,512 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:34,533 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:34,559 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 21:23:34,634 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 21:23:34,634 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:23:34,642 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:23:34,658 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:23:34,659 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:23:37,878 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 21:23:37,992 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 21:23:38,018 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49804 [2019-12-18 21:23:38,019 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 21:23:38,023 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-18 21:23:38,570 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-18 21:23:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-18 21:23:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:23:38,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:38,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:23:38,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash 792295, now seen corresponding path program 1 times [2019-12-18 21:23:38,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:38,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19458390] [2019-12-18 21:23:38,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:38,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19458390] [2019-12-18 21:23:38,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:38,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:23:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676834593] [2019-12-18 21:23:38,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:38,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:38,938 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-18 21:23:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:39,223 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-18 21:23:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:39,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:23:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:39,320 INFO L225 Difference]: With dead ends: 7932 [2019-12-18 21:23:39,320 INFO L226 Difference]: Without dead ends: 7440 [2019-12-18 21:23:39,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-18 21:23:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-18 21:23:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-18 21:23:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-18 21:23:39,705 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-18 21:23:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:39,705 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-18 21:23:39,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:39,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-18 21:23:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:23:39,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:39,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:39,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1331077168, now seen corresponding path program 1 times [2019-12-18 21:23:39,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:39,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306941262] [2019-12-18 21:23:39,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306941262] [2019-12-18 21:23:39,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:39,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:39,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206853626] [2019-12-18 21:23:39,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:39,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:39,762 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-18 21:23:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:39,815 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-18 21:23:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:39,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:23:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:39,824 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 21:23:39,824 INFO L226 Difference]: Without dead ends: 1230 [2019-12-18 21:23:39,827 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 21:23:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-18 21:23:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-18 21:23:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-18 21:23:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-18 21:23:39,938 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-18 21:23:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:39,938 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-18 21:23:39,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-18 21:23:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:23:39,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:39,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:39,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 265392593, now seen corresponding path program 1 times [2019-12-18 21:23:39,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:39,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605507763] [2019-12-18 21:23:39,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605507763] [2019-12-18 21:23:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:40,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907445870] [2019-12-18 21:23:40,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:40,035 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-18 21:23:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:40,104 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-18 21:23:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:40,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:23:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:40,116 INFO L225 Difference]: With dead ends: 1956 [2019-12-18 21:23:40,116 INFO L226 Difference]: Without dead ends: 1956 [2019-12-18 21:23:40,116 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 21:23:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-18 21:23:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-18 21:23:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-18 21:23:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-18 21:23:40,159 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-18 21:23:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:40,160 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-18 21:23:40,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-18 21:23:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:23:40,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:40,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:40,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 175245027, now seen corresponding path program 1 times [2019-12-18 21:23:40,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:40,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845993843] [2019-12-18 21:23:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:40,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845993843] [2019-12-18 21:23:40,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:40,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952167262] [2019-12-18 21:23:40,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:40,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:40,260 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-18 21:23:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:40,426 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-18 21:23:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:23:40,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:23:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:40,437 INFO L225 Difference]: With dead ends: 1678 [2019-12-18 21:23:40,438 INFO L226 Difference]: Without dead ends: 1678 [2019-12-18 21:23:40,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-18 21:23:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-18 21:23:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-18 21:23:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-18 21:23:40,487 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-18 21:23:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:40,487 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-18 21:23:40,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-18 21:23:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:23:40,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:40,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:40,489 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 941909210, now seen corresponding path program 1 times [2019-12-18 21:23:40,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:40,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782442740] [2019-12-18 21:23:40,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:40,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782442740] [2019-12-18 21:23:40,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:40,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:40,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725493731] [2019-12-18 21:23:40,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:40,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:40,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:40,546 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-18 21:23:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:40,709 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-18 21:23:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:23:40,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:23:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:40,722 INFO L225 Difference]: With dead ends: 1981 [2019-12-18 21:23:40,722 INFO L226 Difference]: Without dead ends: 1981 [2019-12-18 21:23:40,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-18 21:23:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-18 21:23:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-18 21:23:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-18 21:23:40,765 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-18 21:23:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:40,766 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-18 21:23:40,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-18 21:23:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:23:40,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:40,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:40,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1601113905, now seen corresponding path program 1 times [2019-12-18 21:23:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:40,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776443810] [2019-12-18 21:23:40,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:40,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776443810] [2019-12-18 21:23:40,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:40,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:40,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961250528] [2019-12-18 21:23:40,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:23:40,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:23:40,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:40,873 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-18 21:23:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:41,115 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-18 21:23:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:23:41,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 21:23:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:41,140 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 21:23:41,140 INFO L226 Difference]: Without dead ends: 2240 [2019-12-18 21:23:41,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:23:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-18 21:23:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-18 21:23:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-18 21:23:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-18 21:23:41,205 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-18 21:23:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:41,206 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-18 21:23:41,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:23:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-18 21:23:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:23:41,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:41,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:41,209 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash 16465726, now seen corresponding path program 1 times [2019-12-18 21:23:41,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:41,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170232824] [2019-12-18 21:23:41,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:41,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170232824] [2019-12-18 21:23:41,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:41,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:41,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259097752] [2019-12-18 21:23:41,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:41,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:41,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:41,330 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-18 21:23:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:41,369 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-18 21:23:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:41,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 21:23:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:41,377 INFO L225 Difference]: With dead ends: 2574 [2019-12-18 21:23:41,377 INFO L226 Difference]: Without dead ends: 2574 [2019-12-18 21:23:41,378 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 21:23:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-18 21:23:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-18 21:23:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 21:23:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-18 21:23:41,427 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-18 21:23:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:41,427 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-18 21:23:41,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-18 21:23:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:23:41,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:41,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:41,430 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1111732337, now seen corresponding path program 1 times [2019-12-18 21:23:41,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:41,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992187274] [2019-12-18 21:23:41,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:41,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992187274] [2019-12-18 21:23:41,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:41,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:41,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581259370] [2019-12-18 21:23:41,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:41,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:41,489 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 3 states. [2019-12-18 21:23:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:41,507 INFO L93 Difference]: Finished difference Result 3059 states and 6636 transitions. [2019-12-18 21:23:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:41,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 21:23:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:41,512 INFO L225 Difference]: With dead ends: 3059 [2019-12-18 21:23:41,512 INFO L226 Difference]: Without dead ends: 1405 [2019-12-18 21:23:41,512 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 21:23:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-18 21:23:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1385. [2019-12-18 21:23:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-12-18 21:23:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2946 transitions. [2019-12-18 21:23:41,547 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2946 transitions. Word has length 26 [2019-12-18 21:23:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:41,548 INFO L462 AbstractCegarLoop]: Abstraction has 1385 states and 2946 transitions. [2019-12-18 21:23:41,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2946 transitions. [2019-12-18 21:23:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:23:41,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:41,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:41,550 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash 858483252, now seen corresponding path program 1 times [2019-12-18 21:23:41,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:41,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107680143] [2019-12-18 21:23:41,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:41,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107680143] [2019-12-18 21:23:41,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:41,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:41,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193805688] [2019-12-18 21:23:41,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:23:41,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:41,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:23:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:41,642 INFO L87 Difference]: Start difference. First operand 1385 states and 2946 transitions. Second operand 5 states. [2019-12-18 21:23:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:41,789 INFO L93 Difference]: Finished difference Result 1390 states and 2937 transitions. [2019-12-18 21:23:41,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:23:41,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:23:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:41,796 INFO L225 Difference]: With dead ends: 1390 [2019-12-18 21:23:41,796 INFO L226 Difference]: Without dead ends: 1390 [2019-12-18 21:23:41,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:23:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-12-18 21:23:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1347. [2019-12-18 21:23:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-12-18 21:23:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2871 transitions. [2019-12-18 21:23:41,829 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2871 transitions. Word has length 26 [2019-12-18 21:23:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:41,830 INFO L462 AbstractCegarLoop]: Abstraction has 1347 states and 2871 transitions. [2019-12-18 21:23:41,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:23:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2871 transitions. [2019-12-18 21:23:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:23:41,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:41,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:41,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1256798795, now seen corresponding path program 1 times [2019-12-18 21:23:41,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208112617] [2019-12-18 21:23:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:41,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208112617] [2019-12-18 21:23:41,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:41,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:23:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021646026] [2019-12-18 21:23:41,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:23:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:23:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:23:41,925 INFO L87 Difference]: Start difference. First operand 1347 states and 2871 transitions. Second operand 5 states. [2019-12-18 21:23:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:42,385 INFO L93 Difference]: Finished difference Result 2150 states and 4509 transitions. [2019-12-18 21:23:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:23:42,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:23:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:42,392 INFO L225 Difference]: With dead ends: 2150 [2019-12-18 21:23:42,393 INFO L226 Difference]: Without dead ends: 2150 [2019-12-18 21:23:42,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:23:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-12-18 21:23:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1941. [2019-12-18 21:23:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-12-18 21:23:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 4107 transitions. [2019-12-18 21:23:42,436 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 4107 transitions. Word has length 27 [2019-12-18 21:23:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:42,437 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 4107 transitions. [2019-12-18 21:23:42,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:23:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 4107 transitions. [2019-12-18 21:23:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:23:42,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:42,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:42,441 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash -374854062, now seen corresponding path program 1 times [2019-12-18 21:23:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098554083] [2019-12-18 21:23:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:42,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098554083] [2019-12-18 21:23:42,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:42,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:23:42,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723748478] [2019-12-18 21:23:42,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:23:42,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:23:42,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:23:42,559 INFO L87 Difference]: Start difference. First operand 1941 states and 4107 transitions. Second operand 4 states. [2019-12-18 21:23:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:42,574 INFO L93 Difference]: Finished difference Result 1087 states and 2170 transitions. [2019-12-18 21:23:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:23:42,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 21:23:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:42,577 INFO L225 Difference]: With dead ends: 1087 [2019-12-18 21:23:42,577 INFO L226 Difference]: Without dead ends: 981 [2019-12-18 21:23:42,577 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 21:23:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-18 21:23:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 909. [2019-12-18 21:23:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-18 21:23:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1885 transitions. [2019-12-18 21:23:42,596 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1885 transitions. Word has length 28 [2019-12-18 21:23:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:42,596 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1885 transitions. [2019-12-18 21:23:42,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:23:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1885 transitions. [2019-12-18 21:23:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:23:42,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:42,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:42,601 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1671814948, now seen corresponding path program 1 times [2019-12-18 21:23:42,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:42,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337265974] [2019-12-18 21:23:42,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:42,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 21:23:42,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337265974] [2019-12-18 21:23:42,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:42,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:23:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452287621] [2019-12-18 21:23:42,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:23:42,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:23:42,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:23:42,741 INFO L87 Difference]: Start difference. First operand 909 states and 1885 transitions. Second operand 7 states. [2019-12-18 21:23:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:42,970 INFO L93 Difference]: Finished difference Result 1569 states and 3170 transitions. [2019-12-18 21:23:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:23:42,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:23:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:42,974 INFO L225 Difference]: With dead ends: 1569 [2019-12-18 21:23:42,974 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 21:23:42,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:23:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 21:23:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 907. [2019-12-18 21:23:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-18 21:23:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1857 transitions. [2019-12-18 21:23:42,992 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1857 transitions. Word has length 51 [2019-12-18 21:23:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:42,993 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1857 transitions. [2019-12-18 21:23:42,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:23:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1857 transitions. [2019-12-18 21:23:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:23:42,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:42,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:42,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1673779650, now seen corresponding path program 2 times [2019-12-18 21:23:42,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:42,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15994807] [2019-12-18 21:23:42,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15994807] [2019-12-18 21:23:43,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:43,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:23:43,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381409086] [2019-12-18 21:23:43,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:23:43,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:23:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:23:43,098 INFO L87 Difference]: Start difference. First operand 907 states and 1857 transitions. Second operand 6 states. [2019-12-18 21:23:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:43,583 INFO L93 Difference]: Finished difference Result 1063 states and 2153 transitions. [2019-12-18 21:23:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:23:43,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 21:23:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:43,589 INFO L225 Difference]: With dead ends: 1063 [2019-12-18 21:23:43,589 INFO L226 Difference]: Without dead ends: 1063 [2019-12-18 21:23:43,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:23:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-12-18 21:23:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 937. [2019-12-18 21:23:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-18 21:23:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1912 transitions. [2019-12-18 21:23:43,616 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1912 transitions. Word has length 51 [2019-12-18 21:23:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:43,617 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1912 transitions. [2019-12-18 21:23:43,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:23:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1912 transitions. [2019-12-18 21:23:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:23:43,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:43,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:43,620 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -251445194, now seen corresponding path program 3 times [2019-12-18 21:23:43,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:43,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720604038] [2019-12-18 21:23:43,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:43,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720604038] [2019-12-18 21:23:43,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:43,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:43,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105560182] [2019-12-18 21:23:43,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:43,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:43,725 INFO L87 Difference]: Start difference. First operand 937 states and 1912 transitions. Second operand 3 states. [2019-12-18 21:23:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:43,774 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-18 21:23:43,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:43,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:23:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:43,777 INFO L225 Difference]: With dead ends: 1175 [2019-12-18 21:23:43,778 INFO L226 Difference]: Without dead ends: 1175 [2019-12-18 21:23:43,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-18 21:23:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-18 21:23:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-18 21:23:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-18 21:23:43,798 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-18 21:23:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:43,802 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-18 21:23:43,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-18 21:23:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:23:43,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:43,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:43,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:43,806 INFO L82 PathProgramCache]: Analyzing trace with hash 187010410, now seen corresponding path program 1 times [2019-12-18 21:23:43,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:43,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106124292] [2019-12-18 21:23:43,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:43,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106124292] [2019-12-18 21:23:43,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:43,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:23:43,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022682102] [2019-12-18 21:23:43,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:23:43,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:43,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:23:43,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:23:43,933 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 7 states. [2019-12-18 21:23:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:44,619 INFO L93 Difference]: Finished difference Result 1141 states and 2310 transitions. [2019-12-18 21:23:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:23:44,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:23:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:44,622 INFO L225 Difference]: With dead ends: 1141 [2019-12-18 21:23:44,622 INFO L226 Difference]: Without dead ends: 1141 [2019-12-18 21:23:44,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:23:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-12-18 21:23:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1039. [2019-12-18 21:23:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-18 21:23:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-18 21:23:44,645 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-18 21:23:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:44,646 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-18 21:23:44,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:23:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-18 21:23:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:23:44,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:44,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:44,649 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 419680803, now seen corresponding path program 1 times [2019-12-18 21:23:44,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:44,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78172965] [2019-12-18 21:23:44,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:44,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78172965] [2019-12-18 21:23:44,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:44,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:23:44,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138555991] [2019-12-18 21:23:44,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:23:44,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:23:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:23:44,759 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 6 states. [2019-12-18 21:23:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:45,279 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-18 21:23:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:23:45,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:23:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:45,282 INFO L225 Difference]: With dead ends: 1291 [2019-12-18 21:23:45,282 INFO L226 Difference]: Without dead ends: 1291 [2019-12-18 21:23:45,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:23:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-18 21:23:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-18 21:23:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-18 21:23:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-18 21:23:45,327 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-18 21:23:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:45,328 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-18 21:23:45,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:23:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-18 21:23:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:23:45,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:45,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:45,331 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1329705586, now seen corresponding path program 2 times [2019-12-18 21:23:45,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:45,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759712611] [2019-12-18 21:23:45,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:23:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:23:45,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759712611] [2019-12-18 21:23:45,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:23:45,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:23:45,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583369257] [2019-12-18 21:23:45,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:23:45,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:23:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:23:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:45,444 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-18 21:23:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:23:45,456 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-18 21:23:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:23:45,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:23:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:23:45,459 INFO L225 Difference]: With dead ends: 1075 [2019-12-18 21:23:45,459 INFO L226 Difference]: Without dead ends: 1075 [2019-12-18 21:23:45,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:23:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-18 21:23:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-18 21:23:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-18 21:23:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-18 21:23:45,475 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-18 21:23:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:23:45,475 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-18 21:23:45,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:23:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-18 21:23:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:23:45,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:23:45,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:23:45,478 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:23:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:23:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 821444371, now seen corresponding path program 1 times [2019-12-18 21:23:45,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:23:45,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422853336] [2019-12-18 21:23:45,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:23:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:23:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:23:45,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:23:45,595 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:23:45,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1089~0.base_22| 4)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_24 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~z$r_buff1_thd2~0_49) (= (store .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_22| 1) |v_#valid_47|) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_9) (= 0 v_~z$r_buff1_thd1~0_20) (< 0 |v_#StackHeapBarrier_14|) (= v_~x~0_18 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1089~0.base_22|) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1089~0.base_22|)) (= |v_ULTIMATE.start_main_~#t1089~0.offset_17| 0) (= 0 v_~z$r_buff1_thd0~0_27) (= v_~z$r_buff0_thd2~0_78 0) (= 0 v_~z$w_buff1_used~0_65) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1089~0.base_22| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1089~0.base_22|) |v_ULTIMATE.start_main_~#t1089~0.offset_17| 0))) (= v_~z$r_buff0_thd1~0_28 0) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_49, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_23, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_21|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t1089~0.offset=|v_ULTIMATE.start_main_~#t1089~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_27, #length=|v_#length_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t1089~0.base=|v_ULTIMATE.start_main_~#t1089~0.base_22|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1090~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1089~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1089~0.base, ULTIMATE.start_main_~#t1090~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:23:45,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1090~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1090~0.base_11|) |v_ULTIMATE.start_main_~#t1090~0.offset_10| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1090~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1090~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1090~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1090~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1090~0.offset=|v_ULTIMATE.start_main_~#t1090~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1090~0.base=|v_ULTIMATE.start_main_~#t1090~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1090~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1090~0.base] because there is no mapped edge [2019-12-18 21:23:45,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~z$r_buff0_thd1~0_Out-174980454 1) (= ~z$r_buff1_thd0~0_Out-174980454 ~z$r_buff0_thd0~0_In-174980454) (= ~x~0_Out-174980454 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-174980454 0)) (= ~z$r_buff1_thd2~0_Out-174980454 ~z$r_buff0_thd2~0_In-174980454) (= ~z$r_buff0_thd1~0_In-174980454 ~z$r_buff1_thd1~0_Out-174980454)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174980454, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-174980454, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-174980454, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-174980454} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-174980454, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-174980454, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-174980454, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-174980454, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-174980454, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-174980454, ~x~0=~x~0_Out-174980454, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-174980454} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:23:45,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1178856395 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1178856395 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1178856395|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1178856395| ~z$w_buff0_used~0_In1178856395) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1178856395, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1178856395} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1178856395|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1178856395, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1178856395} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:23:45,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1937994294 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1937994294 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1937994294 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1937994294 256)))) (or (and (= ~z$w_buff1_used~0_In1937994294 |P0Thread1of1ForFork0_#t~ite6_Out1937994294|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1937994294|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1937994294, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1937994294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1937994294, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1937994294} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1937994294|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1937994294, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1937994294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1937994294, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1937994294} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:23:45,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1233133667 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1233133667 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1233133667) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1233133667 ~z$r_buff0_thd1~0_Out1233133667) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1233133667, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1233133667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1233133667, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1233133667|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1233133667} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:23:45,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1284245676 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1284245676 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1284245676 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1284245676 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1284245676| ~z$r_buff1_thd1~0_In-1284245676)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1284245676| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284245676, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1284245676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284245676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1284245676} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284245676, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1284245676|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1284245676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284245676, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1284245676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:23:45,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_16)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:23:45,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd2~0_53 v_~z$r_buff0_thd2~0_52)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_53} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:23:45,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L773-->L773-8: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out273612049| |P1Thread1of1ForFork1_#t~ite29_Out273612049|)) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In273612049 256))) (.cse0 (= (mod ~weak$$choice2~0_In273612049 256) 0)) (.cse4 (= (mod ~z$r_buff1_thd2~0_In273612049 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In273612049 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In273612049 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In273612049| |P1Thread1of1ForFork1_#t~ite28_Out273612049|) (or (and (not .cse0) (= ~z$r_buff1_thd2~0_In273612049 |P1Thread1of1ForFork1_#t~ite30_Out273612049|) (= |P1Thread1of1ForFork1_#t~ite29_In273612049| |P1Thread1of1ForFork1_#t~ite29_Out273612049|)) (and .cse1 .cse0 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)) (= ~z$r_buff1_thd2~0_In273612049 |P1Thread1of1ForFork1_#t~ite29_Out273612049|)))) (let ((.cse6 (not .cse3))) (and .cse1 (or .cse6 (not .cse5)) (= |P1Thread1of1ForFork1_#t~ite29_Out273612049| |P1Thread1of1ForFork1_#t~ite28_Out273612049|) .cse0 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out273612049|) (or (not .cse4) .cse6) (not .cse2))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In273612049|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In273612049, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In273612049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In273612049, ~weak$$choice2~0=~weak$$choice2~0_In273612049, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In273612049, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In273612049|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out273612049|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out273612049|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In273612049, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In273612049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In273612049, ~weak$$choice2~0=~weak$$choice2~0_In273612049, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In273612049, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out273612049|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:23:45,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:23:45,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1820955960 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1820955960 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1820955960 |P1Thread1of1ForFork1_#t~ite32_Out-1820955960|)) (and (or .cse0 .cse1) (= ~z~0_In-1820955960 |P1Thread1of1ForFork1_#t~ite32_Out-1820955960|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1820955960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820955960, ~z$w_buff1~0=~z$w_buff1~0_In-1820955960, ~z~0=~z~0_In-1820955960} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1820955960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820955960, ~z$w_buff1~0=~z$w_buff1~0_In-1820955960, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1820955960|, ~z~0=~z~0_In-1820955960} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:23:45,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-18 21:23:45,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-557431113 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-557431113 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-557431113| ~z$w_buff0_used~0_In-557431113) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-557431113| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-557431113, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-557431113} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-557431113, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-557431113|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-557431113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:23:45,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1462609917 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1462609917 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1462609917 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1462609917 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1462609917 |P1Thread1of1ForFork1_#t~ite35_Out1462609917|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1462609917|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1462609917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1462609917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462609917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1462609917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1462609917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1462609917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462609917, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1462609917|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1462609917} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:23:45,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-121148991 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-121148991 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-121148991|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-121148991 |P1Thread1of1ForFork1_#t~ite36_Out-121148991|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-121148991, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-121148991} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-121148991, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-121148991, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-121148991|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:23:45,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2050935844 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2050935844 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In2050935844 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2050935844 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In2050935844 |P1Thread1of1ForFork1_#t~ite37_Out2050935844|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2050935844|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2050935844, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2050935844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2050935844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2050935844} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2050935844, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2050935844, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2050935844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2050935844, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2050935844|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:23:45,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:23:45,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:23:45,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-892891036 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-892891036 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-892891036| |ULTIMATE.start_main_#t~ite41_Out-892891036|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out-892891036| ~z$w_buff1~0_In-892891036)) (and (= |ULTIMATE.start_main_#t~ite40_Out-892891036| ~z~0_In-892891036) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-892891036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-892891036, ~z$w_buff1~0=~z$w_buff1~0_In-892891036, ~z~0=~z~0_In-892891036} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-892891036|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-892891036|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-892891036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-892891036, ~z$w_buff1~0=~z$w_buff1~0_In-892891036, ~z~0=~z~0_In-892891036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:23:45,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1921129075 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1921129075 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1921129075| ~z$w_buff0_used~0_In1921129075)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1921129075| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1921129075, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921129075} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1921129075, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921129075, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1921129075|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:23:45,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-445995671 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-445995671 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-445995671 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-445995671 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-445995671 |ULTIMATE.start_main_#t~ite43_Out-445995671|)) (and (= |ULTIMATE.start_main_#t~ite43_Out-445995671| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-445995671, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-445995671, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-445995671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-445995671} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-445995671, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-445995671, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-445995671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-445995671, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-445995671|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:23:45,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In64517361 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In64517361 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out64517361| ~z$r_buff0_thd0~0_In64517361) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out64517361| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In64517361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In64517361} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In64517361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In64517361, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out64517361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:23:45,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In983626294 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In983626294 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In983626294 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In983626294 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out983626294| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out983626294| ~z$r_buff1_thd0~0_In983626294) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In983626294, ~z$w_buff0_used~0=~z$w_buff0_used~0_In983626294, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In983626294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983626294} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In983626294, ~z$w_buff0_used~0=~z$w_buff0_used~0_In983626294, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In983626294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983626294, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out983626294|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:23:45,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_19) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:23:45,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:23:45 BasicIcfg [2019-12-18 21:23:45,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:23:45,690 INFO L168 Benchmark]: Toolchain (without parser) took 13168.89 ms. Allocated memory was 144.7 MB in the beginning and 388.5 MB in the end (delta: 243.8 MB). Free memory was 100.7 MB in the beginning and 118.3 MB in the end (delta: -17.6 MB). Peak memory consumption was 226.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,693 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 153.9 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,695 INFO L168 Benchmark]: Boogie Preprocessor took 50.12 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,696 INFO L168 Benchmark]: RCFGBuilder took 844.51 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 104.5 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,697 INFO L168 Benchmark]: TraceAbstraction took 11454.38 ms. Allocated memory was 201.9 MB in the beginning and 388.5 MB in the end (delta: 186.6 MB). Free memory was 104.5 MB in the beginning and 118.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:23:45,704 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.46 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.21 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 153.9 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.12 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.51 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 104.5 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11454.38 ms. Allocated memory was 201.9 MB in the beginning and 388.5 MB in the end (delta: 186.6 MB). Free memory was 104.5 MB in the beginning and 118.3 MB in the end (delta: -13.7 MB). Peak memory consumption was 172.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 4431 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49804 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2224 SDtfs, 1538 SDslu, 4124 SDs, 0 SdLazy, 2573 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3214 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 56603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...