/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:31:37,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:31:37,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:31:37,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:31:37,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:31:37,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:31:37,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:31:37,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:31:37,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:31:37,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:31:37,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:31:37,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:31:37,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:31:37,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:31:37,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:31:37,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:31:37,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:31:37,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:31:37,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:31:37,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:31:37,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:31:37,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:31:37,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:31:37,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:31:37,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:31:37,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:31:37,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:31:37,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:31:37,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:31:37,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:31:37,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:31:37,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:31:37,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:31:37,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:31:37,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:31:37,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:31:37,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:31:37,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:31:37,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:31:37,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:31:37,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:31:37,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:31:37,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:31:37,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:31:37,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:31:37,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:31:37,317 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:31:37,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:31:37,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:31:37,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:31:37,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:31:37,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:31:37,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:31:37,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:31:37,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:31:37,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:31:37,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:31:37,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:31:37,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:31:37,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:31:37,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:31:37,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:31:37,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:31:37,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:31:37,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:31:37,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:31:37,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:31:37,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:31:37,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:31:37,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:31:37,323 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:31:37,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:31:37,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:31:37,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:31:37,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:31:37,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:31:37,676 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:31:37,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-18 13:31:37,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4bdfc7/8f9b4c83e891417193259d5659f9ad42/FLAGc2497c75a [2019-12-18 13:31:38,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:31:38,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-18 13:31:38,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4bdfc7/8f9b4c83e891417193259d5659f9ad42/FLAGc2497c75a [2019-12-18 13:31:38,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4bdfc7/8f9b4c83e891417193259d5659f9ad42 [2019-12-18 13:31:38,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:31:38,574 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:31:38,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:38,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:31:38,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:31:38,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:38" (1/1) ... [2019-12-18 13:31:38,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:38, skipping insertion in model container [2019-12-18 13:31:38,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:31:38" (1/1) ... [2019-12-18 13:31:38,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:31:38,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:31:39,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:39,232 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:31:39,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:31:39,407 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:31:39,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39 WrapperNode [2019-12-18 13:31:39,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:31:39,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:39,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:31:39,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:31:39,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:31:39,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:31:39,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:31:39,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:31:39,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (1/1) ... [2019-12-18 13:31:39,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:31:39,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:31:39,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:31:39,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:31:39,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (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 13:31:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:31:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:31:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:31:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:31:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:31:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:31:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:31:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:31:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:31:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:31:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:31:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:31:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:31:39,601 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 13:31:40,414 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:31:40,415 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:31:40,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:40 BoogieIcfgContainer [2019-12-18 13:31:40,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:31:40,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:31:40,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:31:40,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:31:40,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:31:38" (1/3) ... [2019-12-18 13:31:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a72134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:40, skipping insertion in model container [2019-12-18 13:31:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:31:39" (2/3) ... [2019-12-18 13:31:40,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a72134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:31:40, skipping insertion in model container [2019-12-18 13:31:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:31:40" (3/3) ... [2019-12-18 13:31:40,426 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.oepc.i [2019-12-18 13:31:40,437 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:31:40,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:31:40,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:31:40,451 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:31:40,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:31:40,622 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:31:40,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:31:40,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:31:40,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:31:40,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:31:40,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:31:40,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:31:40,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:31:40,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:31:40,656 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:31:40,657 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:40,748 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:40,749 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:40,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:40,795 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:31:40,847 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:31:40,847 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:31:40,856 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:31:40,877 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:31:40,879 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:46,467 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:46,817 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:31:46,944 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:31:46,973 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:31:46,973 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:31:46,977 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:32:02,774 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:32:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:32:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:32:02,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:02,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:32:02,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:32:02,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:02,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200374496] [2019-12-18 13:32:02,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:02,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200374496] [2019-12-18 13:32:02,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:02,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:32:02,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889126882] [2019-12-18 13:32:02,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:02,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:03,019 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:32:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:04,135 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:32:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:04,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:32:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:07,534 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:32:07,534 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:32:07,536 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 13:32:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:32:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:32:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:32:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:32:17,206 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:32:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:17,206 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:32:17,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:32:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:32:17,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:17,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:17,211 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:32:17,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:17,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422781431] [2019-12-18 13:32:17,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:17,353 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 13:32:17,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422781431] [2019-12-18 13:32:17,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:17,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:17,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615043531] [2019-12-18 13:32:17,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:17,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:17,357 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:32:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:22,582 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:32:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:22,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:32:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:23,191 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:32:23,192 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:32:23,193 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 13:32:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:32:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:32:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:32:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:32:31,426 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:32:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:31,426 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:32:31,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:32:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:32:31,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:31,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:31,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:32:31,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:31,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491652531] [2019-12-18 13:32:31,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:31,521 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 13:32:31,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491652531] [2019-12-18 13:32:31,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:31,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:31,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048982368] [2019-12-18 13:32:31,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:31,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:31,523 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:32:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:35,679 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:32:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:35,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:32:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:35,737 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:32:35,738 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:32:35,738 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 13:32:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:32:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:32:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:32:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:32:36,324 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:32:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:36,324 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:32:36,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:32:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:32:36,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:36,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:36,328 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:36,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:36,328 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:32:36,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:36,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919545548] [2019-12-18 13:32:36,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:36,418 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 13:32:36,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919545548] [2019-12-18 13:32:36,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:36,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:32:36,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044556711] [2019-12-18 13:32:36,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:36,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:36,425 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:32:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:36,788 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:32:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:36,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:32:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:36,850 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:32:36,850 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:32:36,850 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 13:32:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:32:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:32:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:32:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:32:37,928 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:32:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:37,929 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:32:37,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:32:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:32:37,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:37,938 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] [2019-12-18 13:32:37,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:32:37,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:37,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301922360] [2019-12-18 13:32:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:38,021 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 13:32:38,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301922360] [2019-12-18 13:32:38,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:38,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:38,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217488900] [2019-12-18 13:32:38,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:38,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:38,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:38,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:38,024 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:32:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:38,609 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:32:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:38,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:32:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:38,681 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:32:38,681 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:32:38,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:32:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:32:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:32:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:32:39,339 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:32:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:32:39,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:32:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:32:39,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:39,352 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 13:32:39,352 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:32:39,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:39,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857860805] [2019-12-18 13:32:39,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:39,418 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 13:32:39,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857860805] [2019-12-18 13:32:39,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:39,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:39,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507454328] [2019-12-18 13:32:39,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:32:39,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:32:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:32:39,423 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:32:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:39,481 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:32:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:32:39,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:32:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:39,500 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:32:39,500 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:32:39,500 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 13:32:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:32:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:32:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:32:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:32:39,697 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:32:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:39,698 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:32:39,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:32:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:32:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:39,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:39,709 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 13:32:39,710 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:32:39,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:39,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469071653] [2019-12-18 13:32:39,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:39,764 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 13:32:39,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469071653] [2019-12-18 13:32:39,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:39,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:39,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623190011] [2019-12-18 13:32:39,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:39,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:39,767 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:32:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:39,871 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:32:39,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:39,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:39,906 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:32:39,906 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:32:39,906 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 13:32:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:32:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:32:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:32:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:32:40,342 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:32:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:40,343 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:32:40,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:32:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:40,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:40,352 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 13:32:40,353 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:32:40,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:40,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749293774] [2019-12-18 13:32:40,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:40,391 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 13:32:40,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749293774] [2019-12-18 13:32:40,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:40,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:32:40,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795912828] [2019-12-18 13:32:40,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:40,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:40,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:40,393 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:32:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:40,478 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:32:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:40,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:32:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:40,505 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:32:40,506 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:32:40,506 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 13:32:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:32:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:32:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:32:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:32:40,778 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:32:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:40,778 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:32:40,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:32:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:32:40,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:40,790 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 13:32:40,790 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:32:40,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:40,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021624014] [2019-12-18 13:32:40,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:40,878 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 13:32:40,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021624014] [2019-12-18 13:32:40,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:40,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:40,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646640505] [2019-12-18 13:32:40,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:40,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:40,880 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:32:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:41,475 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:32:41,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:41,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:32:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:41,532 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:32:41,532 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:32:41,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:32:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:32:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:32:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:32:41,884 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:32:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:41,884 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:32:41,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:32:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:32:41,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:41,897 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 13:32:41,897 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:32:41,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:41,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918730428] [2019-12-18 13:32:41,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:41,980 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 13:32:41,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918730428] [2019-12-18 13:32:41,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:41,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:41,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060365664] [2019-12-18 13:32:41,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:32:41,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:41,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:32:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:32:41,982 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:32:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:42,536 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:32:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:32:42,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:32:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:42,577 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:32:42,577 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:32:42,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:32:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:32:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:32:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:32:42,927 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:32:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:42,927 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:32:42,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:32:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:32:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:42,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:42,946 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] [2019-12-18 13:32:42,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:32:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:42,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629249583] [2019-12-18 13:32:42,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:43,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 13:32:43,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629249583] [2019-12-18 13:32:43,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:43,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:43,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584052746] [2019-12-18 13:32:43,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:43,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:43,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:43,035 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:32:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:44,333 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:32:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:44,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:32:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:44,388 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:32:44,389 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:32:44,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:32:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:32:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:32:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:32:44,820 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:32:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:44,820 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:32:44,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:32:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:32:44,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:44,839 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] [2019-12-18 13:32:44,840 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:32:44,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:44,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134061298] [2019-12-18 13:32:44,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:44,968 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 13:32:44,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134061298] [2019-12-18 13:32:44,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:44,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:44,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976468053] [2019-12-18 13:32:44,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:44,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:44,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:44,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:44,971 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:32:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:46,735 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:32:46,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:46,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:32:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:46,799 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:32:46,799 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:32:46,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:32:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:32:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:32:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:32:47,268 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:32:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:47,268 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:32:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:32:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:47,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:47,287 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] [2019-12-18 13:32:47,287 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:32:47,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:47,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629020899] [2019-12-18 13:32:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:47,403 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 13:32:47,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629020899] [2019-12-18 13:32:47,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:47,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:47,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824096824] [2019-12-18 13:32:47,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:47,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:47,405 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:32:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:48,788 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:32:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:32:48,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:32:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:48,858 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:32:48,859 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:32:48,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:32:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:32:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:32:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:32:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:32:49,263 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:32:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:32:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:32:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:49,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:49,280 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] [2019-12-18 13:32:49,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:32:49,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:49,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040153270] [2019-12-18 13:32:49,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:49,401 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 13:32:49,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040153270] [2019-12-18 13:32:49,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:49,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:32:49,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857195912] [2019-12-18 13:32:49,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:49,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:49,403 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-18 13:32:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:50,709 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 13:32:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:32:50,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:32:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:50,768 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 13:32:50,769 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 13:32:50,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:32:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 13:32:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 13:32:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 13:32:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 13:32:51,204 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 13:32:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:51,204 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 13:32:51,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:32:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 13:32:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:32:51,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:51,220 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] [2019-12-18 13:32:51,220 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:32:51,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:51,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380300091] [2019-12-18 13:32:51,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:51,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380300091] [2019-12-18 13:32:51,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:51,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:51,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31950279] [2019-12-18 13:32:51,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:32:51,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:51,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:32:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:32:51,325 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-18 13:32:52,475 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-18 13:32:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:53,077 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-18 13:32:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:53,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:32:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:53,146 INFO L225 Difference]: With dead ends: 39307 [2019-12-18 13:32:53,146 INFO L226 Difference]: Without dead ends: 39307 [2019-12-18 13:32:53,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:32:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-18 13:32:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-18 13:32:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 13:32:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-18 13:32:53,538 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-18 13:32:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:53,538 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-18 13:32:53,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:32:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-18 13:32:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:32:53,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:53,561 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] [2019-12-18 13:32:53,561 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:32:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:53,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398223555] [2019-12-18 13:32:53,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:53,614 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 13:32:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398223555] [2019-12-18 13:32:53,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:53,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:32:53,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899032248] [2019-12-18 13:32:53,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:32:53,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:32:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:32:53,616 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-18 13:32:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:53,683 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-18 13:32:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:32:53,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:32:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:53,713 INFO L225 Difference]: With dead ends: 16672 [2019-12-18 13:32:53,713 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 13:32:53,714 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 13:32:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 13:32:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 13:32:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 13:32:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-18 13:32:53,966 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-18 13:32:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:53,967 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-18 13:32:53,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:32:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-18 13:32:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:32:53,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:53,988 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] [2019-12-18 13:32:53,989 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:32:53,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:53,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332624712] [2019-12-18 13:32:53,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:32:54,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332624712] [2019-12-18 13:32:54,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:54,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:32:54,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132071432] [2019-12-18 13:32:54,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:32:54,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:32:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:54,038 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-18 13:32:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:54,123 INFO L93 Difference]: Finished difference Result 15470 states and 47032 transitions. [2019-12-18 13:32:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:32:54,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:32:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:54,153 INFO L225 Difference]: With dead ends: 15470 [2019-12-18 13:32:54,153 INFO L226 Difference]: Without dead ends: 15470 [2019-12-18 13:32:54,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:32:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-18 13:32:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 14854. [2019-12-18 13:32:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14854 states. [2019-12-18 13:32:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14854 states to 14854 states and 45370 transitions. [2019-12-18 13:32:54,407 INFO L78 Accepts]: Start accepts. Automaton has 14854 states and 45370 transitions. Word has length 40 [2019-12-18 13:32:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:54,407 INFO L462 AbstractCegarLoop]: Abstraction has 14854 states and 45370 transitions. [2019-12-18 13:32:54,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:32:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 14854 states and 45370 transitions. [2019-12-18 13:32:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:54,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:54,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:54,423 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1274465795, now seen corresponding path program 1 times [2019-12-18 13:32:54,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:54,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341344795] [2019-12-18 13:32:54,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:54,545 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 13:32:54,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341344795] [2019-12-18 13:32:54,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:54,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:54,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029399202] [2019-12-18 13:32:54,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:54,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:54,552 INFO L87 Difference]: Start difference. First operand 14854 states and 45370 transitions. Second operand 9 states. [2019-12-18 13:32:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:56,003 INFO L93 Difference]: Finished difference Result 84074 states and 252399 transitions. [2019-12-18 13:32:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:32:56,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:56,114 INFO L225 Difference]: With dead ends: 84074 [2019-12-18 13:32:56,114 INFO L226 Difference]: Without dead ends: 76042 [2019-12-18 13:32:56,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:32:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76042 states. [2019-12-18 13:32:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76042 to 16177. [2019-12-18 13:32:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16177 states. [2019-12-18 13:32:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16177 states to 16177 states and 49723 transitions. [2019-12-18 13:32:56,940 INFO L78 Accepts]: Start accepts. Automaton has 16177 states and 49723 transitions. Word has length 64 [2019-12-18 13:32:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:56,941 INFO L462 AbstractCegarLoop]: Abstraction has 16177 states and 49723 transitions. [2019-12-18 13:32:56,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16177 states and 49723 transitions. [2019-12-18 13:32:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:56,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:56,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:56,958 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash 977977381, now seen corresponding path program 2 times [2019-12-18 13:32:56,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:56,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814105627] [2019-12-18 13:32:56,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:57,063 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 13:32:57,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814105627] [2019-12-18 13:32:57,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:57,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:32:57,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998103911] [2019-12-18 13:32:57,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:32:57,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:32:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:32:57,066 INFO L87 Difference]: Start difference. First operand 16177 states and 49723 transitions. Second operand 9 states. [2019-12-18 13:32:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:32:58,778 INFO L93 Difference]: Finished difference Result 96579 states and 288366 transitions. [2019-12-18 13:32:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 13:32:58,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:32:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:32:58,878 INFO L225 Difference]: With dead ends: 96579 [2019-12-18 13:32:58,878 INFO L226 Difference]: Without dead ends: 66609 [2019-12-18 13:32:58,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:32:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66609 states. [2019-12-18 13:32:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66609 to 18049. [2019-12-18 13:32:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18049 states. [2019-12-18 13:32:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18049 states to 18049 states and 55578 transitions. [2019-12-18 13:32:59,508 INFO L78 Accepts]: Start accepts. Automaton has 18049 states and 55578 transitions. Word has length 64 [2019-12-18 13:32:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:32:59,509 INFO L462 AbstractCegarLoop]: Abstraction has 18049 states and 55578 transitions. [2019-12-18 13:32:59,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:32:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18049 states and 55578 transitions. [2019-12-18 13:32:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:32:59,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:32:59,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:32:59,531 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:32:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:32:59,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2145716829, now seen corresponding path program 3 times [2019-12-18 13:32:59,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:32:59,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504531614] [2019-12-18 13:32:59,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:32:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:32:59,618 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 13:32:59,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504531614] [2019-12-18 13:32:59,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:32:59,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:32:59,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564788430] [2019-12-18 13:32:59,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:32:59,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:32:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:32:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:32:59,620 INFO L87 Difference]: Start difference. First operand 18049 states and 55578 transitions. Second operand 7 states. [2019-12-18 13:33:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:00,244 INFO L93 Difference]: Finished difference Result 48648 states and 147372 transitions. [2019-12-18 13:33:00,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:33:00,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:33:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:00,296 INFO L225 Difference]: With dead ends: 48648 [2019-12-18 13:33:00,296 INFO L226 Difference]: Without dead ends: 37520 [2019-12-18 13:33:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:33:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37520 states. [2019-12-18 13:33:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37520 to 22070. [2019-12-18 13:33:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22070 states. [2019-12-18 13:33:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22070 states to 22070 states and 68004 transitions. [2019-12-18 13:33:00,751 INFO L78 Accepts]: Start accepts. Automaton has 22070 states and 68004 transitions. Word has length 64 [2019-12-18 13:33:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:00,751 INFO L462 AbstractCegarLoop]: Abstraction has 22070 states and 68004 transitions. [2019-12-18 13:33:00,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:33:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22070 states and 68004 transitions. [2019-12-18 13:33:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:33:00,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:00,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:00,776 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1938623561, now seen corresponding path program 4 times [2019-12-18 13:33:00,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785042204] [2019-12-18 13:33:00,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:00,861 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 13:33:00,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785042204] [2019-12-18 13:33:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:00,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:33:00,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832802890] [2019-12-18 13:33:00,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:33:00,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:33:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:33:00,863 INFO L87 Difference]: Start difference. First operand 22070 states and 68004 transitions. Second operand 7 states. [2019-12-18 13:33:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:01,441 INFO L93 Difference]: Finished difference Result 46848 states and 140470 transitions. [2019-12-18 13:33:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:33:01,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:33:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:01,542 INFO L225 Difference]: With dead ends: 46848 [2019-12-18 13:33:01,542 INFO L226 Difference]: Without dead ends: 39966 [2019-12-18 13:33:01,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:33:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39966 states. [2019-12-18 13:33:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39966 to 22366. [2019-12-18 13:33:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-18 13:33:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 68856 transitions. [2019-12-18 13:33:02,356 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 68856 transitions. Word has length 64 [2019-12-18 13:33:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:02,356 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 68856 transitions. [2019-12-18 13:33:02,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:33:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 68856 transitions. [2019-12-18 13:33:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:33:02,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:02,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:02,383 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 987860387, now seen corresponding path program 5 times [2019-12-18 13:33:02,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:02,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466897221] [2019-12-18 13:33:02,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:02,439 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 13:33:02,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466897221] [2019-12-18 13:33:02,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:02,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:02,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700960702] [2019-12-18 13:33:02,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:02,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:02,441 INFO L87 Difference]: Start difference. First operand 22366 states and 68856 transitions. Second operand 3 states. [2019-12-18 13:33:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:02,603 INFO L93 Difference]: Finished difference Result 26105 states and 80166 transitions. [2019-12-18 13:33:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:02,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:33:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:02,639 INFO L225 Difference]: With dead ends: 26105 [2019-12-18 13:33:02,639 INFO L226 Difference]: Without dead ends: 26105 [2019-12-18 13:33:02,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:33:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26105 states. [2019-12-18 13:33:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26105 to 23179. [2019-12-18 13:33:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23179 states. [2019-12-18 13:33:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23179 states to 23179 states and 71542 transitions. [2019-12-18 13:33:03,011 INFO L78 Accepts]: Start accepts. Automaton has 23179 states and 71542 transitions. Word has length 64 [2019-12-18 13:33:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:03,011 INFO L462 AbstractCegarLoop]: Abstraction has 23179 states and 71542 transitions. [2019-12-18 13:33:03,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23179 states and 71542 transitions. [2019-12-18 13:33:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:33:03,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:03,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:03,037 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1658299500, now seen corresponding path program 1 times [2019-12-18 13:33:03,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:03,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905100447] [2019-12-18 13:33:03,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:03,325 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 13:33:03,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905100447] [2019-12-18 13:33:03,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:03,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:03,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380187845] [2019-12-18 13:33:03,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:03,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:03,329 INFO L87 Difference]: Start difference. First operand 23179 states and 71542 transitions. Second operand 3 states. [2019-12-18 13:33:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:03,545 INFO L93 Difference]: Finished difference Result 31006 states and 95897 transitions. [2019-12-18 13:33:03,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:03,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:33:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:03,593 INFO L225 Difference]: With dead ends: 31006 [2019-12-18 13:33:03,594 INFO L226 Difference]: Without dead ends: 31006 [2019-12-18 13:33:03,594 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 13:33:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31006 states. [2019-12-18 13:33:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31006 to 23854. [2019-12-18 13:33:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23854 states. [2019-12-18 13:33:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23854 states to 23854 states and 73625 transitions. [2019-12-18 13:33:04,008 INFO L78 Accepts]: Start accepts. Automaton has 23854 states and 73625 transitions. Word has length 65 [2019-12-18 13:33:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:04,009 INFO L462 AbstractCegarLoop]: Abstraction has 23854 states and 73625 transitions. [2019-12-18 13:33:04,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23854 states and 73625 transitions. [2019-12-18 13:33:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:33:04,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:04,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:04,033 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:04,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1628140134, now seen corresponding path program 1 times [2019-12-18 13:33:04,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:04,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776619236] [2019-12-18 13:33:04,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:04,153 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 13:33:04,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776619236] [2019-12-18 13:33:04,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:04,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:33:04,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824943745] [2019-12-18 13:33:04,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:33:04,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:33:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:33:04,155 INFO L87 Difference]: Start difference. First operand 23854 states and 73625 transitions. Second operand 9 states. [2019-12-18 13:33:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:05,662 INFO L93 Difference]: Finished difference Result 82536 states and 245855 transitions. [2019-12-18 13:33:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:33:05,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:33:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:05,819 INFO L225 Difference]: With dead ends: 82536 [2019-12-18 13:33:05,819 INFO L226 Difference]: Without dead ends: 75270 [2019-12-18 13:33:05,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:33:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75270 states. [2019-12-18 13:33:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75270 to 24701. [2019-12-18 13:33:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24701 states. [2019-12-18 13:33:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24701 states to 24701 states and 76097 transitions. [2019-12-18 13:33:06,661 INFO L78 Accepts]: Start accepts. Automaton has 24701 states and 76097 transitions. Word has length 65 [2019-12-18 13:33:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:06,661 INFO L462 AbstractCegarLoop]: Abstraction has 24701 states and 76097 transitions. [2019-12-18 13:33:06,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:33:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 24701 states and 76097 transitions. [2019-12-18 13:33:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:33:06,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:06,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:06,688 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2044306796, now seen corresponding path program 2 times [2019-12-18 13:33:06,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:06,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956053319] [2019-12-18 13:33:06,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:06,809 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 13:33:06,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956053319] [2019-12-18 13:33:06,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:06,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:33:06,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402764306] [2019-12-18 13:33:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:33:06,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:33:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:33:06,812 INFO L87 Difference]: Start difference. First operand 24701 states and 76097 transitions. Second operand 9 states. [2019-12-18 13:33:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:08,171 INFO L93 Difference]: Finished difference Result 71008 states and 211325 transitions. [2019-12-18 13:33:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:33:08,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:33:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:08,278 INFO L225 Difference]: With dead ends: 71008 [2019-12-18 13:33:08,278 INFO L226 Difference]: Without dead ends: 67858 [2019-12-18 13:33:08,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:33:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67858 states. [2019-12-18 13:33:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67858 to 23406. [2019-12-18 13:33:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23406 states. [2019-12-18 13:33:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 71957 transitions. [2019-12-18 13:33:08,989 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 71957 transitions. Word has length 65 [2019-12-18 13:33:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 23406 states and 71957 transitions. [2019-12-18 13:33:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:33:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 71957 transitions. [2019-12-18 13:33:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:33:09,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:09,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:09,015 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:09,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1227831362, now seen corresponding path program 3 times [2019-12-18 13:33:09,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:09,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535844555] [2019-12-18 13:33:09,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:09,088 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 13:33:09,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535844555] [2019-12-18 13:33:09,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:09,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:33:09,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197239602] [2019-12-18 13:33:09,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:33:09,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:33:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:33:09,090 INFO L87 Difference]: Start difference. First operand 23406 states and 71957 transitions. Second operand 4 states. [2019-12-18 13:33:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:09,228 INFO L93 Difference]: Finished difference Result 23154 states and 71052 transitions. [2019-12-18 13:33:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:33:09,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:33:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:09,260 INFO L225 Difference]: With dead ends: 23154 [2019-12-18 13:33:09,260 INFO L226 Difference]: Without dead ends: 23154 [2019-12-18 13:33:09,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:33:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23154 states. [2019-12-18 13:33:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23154 to 21666. [2019-12-18 13:33:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-12-18 13:33:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 66283 transitions. [2019-12-18 13:33:09,616 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 66283 transitions. Word has length 65 [2019-12-18 13:33:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:09,617 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 66283 transitions. [2019-12-18 13:33:09,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:33:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 66283 transitions. [2019-12-18 13:33:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:33:09,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:09,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:09,640 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1591414325, now seen corresponding path program 1 times [2019-12-18 13:33:09,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:09,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542707659] [2019-12-18 13:33:09,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:09,689 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 13:33:09,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542707659] [2019-12-18 13:33:09,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:09,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:09,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996695582] [2019-12-18 13:33:09,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:09,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:09,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:09,691 INFO L87 Difference]: Start difference. First operand 21666 states and 66283 transitions. Second operand 3 states. [2019-12-18 13:33:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:09,782 INFO L93 Difference]: Finished difference Result 18896 states and 56756 transitions. [2019-12-18 13:33:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:09,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:33:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:09,820 INFO L225 Difference]: With dead ends: 18896 [2019-12-18 13:33:09,820 INFO L226 Difference]: Without dead ends: 18896 [2019-12-18 13:33:09,820 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 13:33:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18896 states. [2019-12-18 13:33:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18896 to 17930. [2019-12-18 13:33:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17930 states. [2019-12-18 13:33:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17930 states to 17930 states and 53700 transitions. [2019-12-18 13:33:10,125 INFO L78 Accepts]: Start accepts. Automaton has 17930 states and 53700 transitions. Word has length 65 [2019-12-18 13:33:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:10,125 INFO L462 AbstractCegarLoop]: Abstraction has 17930 states and 53700 transitions. [2019-12-18 13:33:10,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17930 states and 53700 transitions. [2019-12-18 13:33:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:33:10,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:10,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:10,336 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-18 13:33:10,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:10,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270951747] [2019-12-18 13:33:10,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:33:10,398 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 13:33:10,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270951747] [2019-12-18 13:33:10,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:33:10,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:33:10,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709921789] [2019-12-18 13:33:10,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:33:10,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:33:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:33:10,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:33:10,400 INFO L87 Difference]: Start difference. First operand 17930 states and 53700 transitions. Second operand 3 states. [2019-12-18 13:33:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:33:10,475 INFO L93 Difference]: Finished difference Result 17930 states and 53699 transitions. [2019-12-18 13:33:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:33:10,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:33:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:33:10,506 INFO L225 Difference]: With dead ends: 17930 [2019-12-18 13:33:10,506 INFO L226 Difference]: Without dead ends: 17930 [2019-12-18 13:33:10,506 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 13:33:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17930 states. [2019-12-18 13:33:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17930 to 15042. [2019-12-18 13:33:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15042 states. [2019-12-18 13:33:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15042 states to 15042 states and 45597 transitions. [2019-12-18 13:33:10,765 INFO L78 Accepts]: Start accepts. Automaton has 15042 states and 45597 transitions. Word has length 66 [2019-12-18 13:33:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:33:10,765 INFO L462 AbstractCegarLoop]: Abstraction has 15042 states and 45597 transitions. [2019-12-18 13:33:10,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:33:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15042 states and 45597 transitions. [2019-12-18 13:33:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:33:10,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:33:10,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:33:10,782 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:33:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:33:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:33:10,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:33:10,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908882983] [2019-12-18 13:33:10,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:33:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:33:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:33:10,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:33:10,909 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:33:10,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1117~0.base_55|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55| 1) |v_#valid_91|) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1117~0.base_55| 4) |v_#length_25|) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55|) 0) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55|) |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_41|, ULTIMATE.start_main_~#t1117~0.offset=|v_ULTIMATE.start_main_~#t1117~0.offset_34|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ULTIMATE.start_main_~#t1117~0.base=|v_ULTIMATE.start_main_~#t1117~0.base_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_19|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_20|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1117~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t1117~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1118~0.offset, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1119~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ULTIMATE.start_main_~#t1119~0.base, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:33:10,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~x~0_In168625103 ~__unbuffered_p0_EAX~0_Out168625103) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In168625103 0)) (= ~a$r_buff0_thd2~0_In168625103 ~a$r_buff1_thd2~0_Out168625103) (= ~a$r_buff0_thd3~0_In168625103 ~a$r_buff1_thd3~0_Out168625103) (= 1 ~a$r_buff0_thd1~0_Out168625103) (= ~a$r_buff1_thd0~0_Out168625103 ~a$r_buff0_thd0~0_In168625103) (= ~a$r_buff1_thd1~0_Out168625103 ~a$r_buff0_thd1~0_In168625103)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In168625103, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In168625103, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In168625103, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In168625103, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In168625103, ~x~0=~x~0_In168625103} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out168625103, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out168625103, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out168625103, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out168625103, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out168625103, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In168625103, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In168625103, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In168625103, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out168625103, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In168625103, ~x~0=~x~0_In168625103} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:33:10,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9|) |v_ULTIMATE.start_main_~#t1118~0.offset_7| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1118~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1118~0.base_9| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1118~0.base_9| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1118~0.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1118~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:33:10,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1119~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1119~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) |v_ULTIMATE.start_main_~#t1119~0.offset_8| 2)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1119~0.base_9| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9| 1) |v_#valid_32|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1119~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1119~0.base] because there is no mapped edge [2019-12-18 13:33:10,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-453044286 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-453044286 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-453044286| |P1Thread1of1ForFork2_#t~ite10_Out-453044286|))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-453044286| ~a$w_buff1~0_In-453044286) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-453044286| ~a~0_In-453044286) .cse1))) InVars {~a~0=~a~0_In-453044286, ~a$w_buff1~0=~a$w_buff1~0_In-453044286, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-453044286, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-453044286} OutVars{~a~0=~a~0_In-453044286, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-453044286|, ~a$w_buff1~0=~a$w_buff1~0_In-453044286, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-453044286, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-453044286|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-453044286} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:33:10,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1359446614 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1359446614 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1359446614| ~a$w_buff0_used~0_In1359446614)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1359446614| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359446614, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359446614} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1359446614, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1359446614, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1359446614|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:33:10,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1859837284 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1859837284 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1859837284 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1859837284 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1859837284|)) (and (= ~a$w_buff1_used~0_In1859837284 |P1Thread1of1ForFork2_#t~ite12_Out1859837284|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1859837284, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1859837284, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1859837284, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1859837284} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1859837284, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1859837284, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1859837284, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1859837284|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1859837284} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:33:10,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1699983052 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1699983052| |P2Thread1of1ForFork0_#t~ite20_Out1699983052|) (= |P2Thread1of1ForFork0_#t~ite21_Out1699983052| ~a$w_buff0~0_In1699983052) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1699983052 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In1699983052 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In1699983052 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1699983052 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out1699983052| ~a$w_buff0~0_In1699983052) (= |P2Thread1of1ForFork0_#t~ite20_Out1699983052| |P2Thread1of1ForFork0_#t~ite21_Out1699983052|) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1699983052, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1699983052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699983052, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1699983052, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699983052, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1699983052|, ~weak$$choice2~0=~weak$$choice2~0_In1699983052} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1699983052|, ~a$w_buff0~0=~a$w_buff0~0_In1699983052, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1699983052, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1699983052, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1699983052, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1699983052|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1699983052, ~weak$$choice2~0=~weak$$choice2~0_In1699983052} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:33:10,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In281247942 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In281247942 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out281247942| ~a$r_buff0_thd2~0_In281247942)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out281247942| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In281247942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In281247942} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In281247942, ~a$w_buff0_used~0=~a$w_buff0_used~0_In281247942, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out281247942|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:33:10,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1586508166 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1586508166 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1586508166 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1586508166 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1586508166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1586508166| ~a$r_buff1_thd2~0_In1586508166)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1586508166, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1586508166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1586508166, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1586508166} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1586508166, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1586508166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1586508166, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1586508166, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1586508166|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:33:10,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:33:10,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-556614538 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-556614538 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-556614538 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In-556614538 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-556614538 256) 0))) (= |P2Thread1of1ForFork0_#t~ite23_Out-556614538| ~a$w_buff1~0_In-556614538) .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out-556614538| |P2Thread1of1ForFork0_#t~ite24_Out-556614538|)) (and (= ~a$w_buff1~0_In-556614538 |P2Thread1of1ForFork0_#t~ite24_Out-556614538|) (= |P2Thread1of1ForFork0_#t~ite23_In-556614538| |P2Thread1of1ForFork0_#t~ite23_Out-556614538|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-556614538, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-556614538|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-556614538, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-556614538, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-556614538, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-556614538, ~weak$$choice2~0=~weak$$choice2~0_In-556614538} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-556614538, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-556614538|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-556614538|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-556614538, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-556614538, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-556614538, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-556614538, ~weak$$choice2~0=~weak$$choice2~0_In-556614538} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:33:10,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1139033059 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1139033059| |P2Thread1of1ForFork0_#t~ite26_Out-1139033059|) (= ~a$w_buff0_used~0_In-1139033059 |P2Thread1of1ForFork0_#t~ite27_Out-1139033059|) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1139033059 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1139033059 256) 0)) (and (= (mod ~a$r_buff1_thd3~0_In-1139033059 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-1139033059 256) 0))) (= ~a$w_buff0_used~0_In-1139033059 |P2Thread1of1ForFork0_#t~ite26_Out-1139033059|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1139033059| |P2Thread1of1ForFork0_#t~ite26_Out-1139033059|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1139033059|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1139033059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1139033059, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1139033059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1139033059, ~weak$$choice2~0=~weak$$choice2~0_In-1139033059} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1139033059|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1139033059|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1139033059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1139033059, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1139033059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1139033059, ~weak$$choice2~0=~weak$$choice2~0_In-1139033059} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:33:10,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:33:10,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:33:10,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1993883038 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1993883038 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1993883038| ~a$w_buff1~0_In-1993883038)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1993883038| ~a~0_In-1993883038) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1993883038, ~a$w_buff1~0=~a$w_buff1~0_In-1993883038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1993883038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1993883038} OutVars{~a~0=~a~0_In-1993883038, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1993883038|, ~a$w_buff1~0=~a$w_buff1~0_In-1993883038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1993883038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1993883038} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:33:10,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:33:10,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-134745479 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-134745479 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-134745479 |P2Thread1of1ForFork0_#t~ite40_Out-134745479|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-134745479|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-134745479, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-134745479} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-134745479|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-134745479, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-134745479} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:33:10,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1569133201 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1569133201 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1569133201 |P0Thread1of1ForFork1_#t~ite5_Out1569133201|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1569133201|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569133201, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1569133201} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1569133201|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569133201, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1569133201} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:33:10,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In971584751 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In971584751 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In971584751 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In971584751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out971584751| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out971584751| ~a$w_buff1_used~0_In971584751) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In971584751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971584751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In971584751, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971584751} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out971584751|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In971584751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971584751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In971584751, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971584751} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:33:10,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1171707974 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1171707974 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1171707974 ~a$r_buff0_thd1~0_Out-1171707974)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1171707974 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1171707974, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1171707974} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1171707974|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1171707974, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1171707974} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:33:10,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-820897877 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-820897877 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-820897877 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-820897877 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-820897877| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-820897877| ~a$r_buff1_thd1~0_In-820897877)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-820897877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-820897877, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-820897877, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820897877} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-820897877|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-820897877, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-820897877, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-820897877, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-820897877} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:33:10,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:33:10,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-401260770 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-401260770 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-401260770 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-401260770 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-401260770| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-401260770| ~a$w_buff1_used~0_In-401260770) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-401260770, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401260770, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-401260770, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-401260770} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-401260770, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401260770, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-401260770, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-401260770, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-401260770|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:33:10,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In348364279 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In348364279 256)))) (or (and (= ~a$r_buff0_thd3~0_In348364279 |P2Thread1of1ForFork0_#t~ite42_Out348364279|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out348364279|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In348364279, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348364279} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In348364279, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In348364279, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out348364279|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:33:10,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1987763592 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1987763592 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1987763592 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1987763592 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1987763592|)) (and (= ~a$r_buff1_thd3~0_In1987763592 |P2Thread1of1ForFork0_#t~ite43_Out1987763592|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1987763592, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1987763592, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1987763592, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1987763592} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1987763592|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1987763592, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1987763592, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1987763592, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1987763592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:33:10,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:33:10,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:33:10,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In361759650 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out361759650| |ULTIMATE.start_main_#t~ite47_Out361759650|)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In361759650 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out361759650| ~a~0_In361759650) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out361759650| ~a$w_buff1~0_In361759650)))) InVars {~a~0=~a~0_In361759650, ~a$w_buff1~0=~a$w_buff1~0_In361759650, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In361759650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In361759650} OutVars{~a~0=~a~0_In361759650, ~a$w_buff1~0=~a$w_buff1~0_In361759650, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out361759650|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In361759650, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out361759650|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In361759650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:33:10,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-806844697 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-806844697 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-806844697| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-806844697| ~a$w_buff0_used~0_In-806844697) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-806844697, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-806844697} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-806844697, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-806844697|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-806844697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:33:10,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1930864309 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1930864309 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1930864309 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1930864309 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1930864309| 0)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1930864309 |ULTIMATE.start_main_#t~ite50_Out1930864309|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1930864309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1930864309, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1930864309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1930864309} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1930864309|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1930864309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1930864309, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1930864309, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1930864309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:33:10,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1409240478 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1409240478 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1409240478|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-1409240478 |ULTIMATE.start_main_#t~ite51_Out-1409240478|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1409240478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1409240478} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1409240478|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1409240478, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1409240478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:33:10,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-2007479647 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-2007479647 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2007479647 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-2007479647 256) 0))) (or (and (= ~a$r_buff1_thd0~0_In-2007479647 |ULTIMATE.start_main_#t~ite52_Out-2007479647|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2007479647|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2007479647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007479647, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2007479647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007479647} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2007479647|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2007479647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007479647, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2007479647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007479647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:33:10,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:33:11,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:33:11 BasicIcfg [2019-12-18 13:33:11,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:33:11,042 INFO L168 Benchmark]: Toolchain (without parser) took 92468.68 ms. Allocated memory was 135.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,043 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.14 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 97.7 MB in the beginning and 151.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 198.2 MB. Free memory was 151.2 MB in the beginning and 149.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,044 INFO L168 Benchmark]: Boogie Preprocessor took 67.74 ms. Allocated memory is still 198.2 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,045 INFO L168 Benchmark]: RCFGBuilder took 876.07 ms. Allocated memory is still 198.2 MB. Free memory was 146.2 MB in the beginning and 95.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,045 INFO L168 Benchmark]: TraceAbstraction took 90622.30 ms. Allocated memory was 198.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 13:33:11,051 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.44 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.14 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 97.7 MB in the beginning and 151.2 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 198.2 MB. Free memory was 151.2 MB in the beginning and 149.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.74 ms. Allocated memory is still 198.2 MB. Free memory was 149.0 MB in the beginning and 146.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.07 ms. Allocated memory is still 198.2 MB. Free memory was 146.2 MB in the beginning and 95.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90622.30 ms. Allocated memory was 198.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 95.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6586 SDtfs, 9653 SDslu, 17815 SDs, 0 SdLazy, 9538 SolverSat, 540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 422680 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 190100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...