/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/mix025_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:56:38,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:56:38,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:56:38,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:56:38,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:56:38,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:56:38,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:56:38,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:56:38,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:56:38,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:56:38,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:56:38,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:56:38,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:56:38,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:56:38,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:56:38,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:56:38,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:56:38,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:56:38,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:56:38,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:56:38,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:56:38,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:56:38,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:56:38,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:56:38,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:56:38,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:56:38,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:56:38,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:56:38,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:56:38,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:56:38,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:56:38,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:56:38,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:56:38,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:56:38,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:56:38,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:56:38,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:56:38,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:56:38,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:56:38,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:56:38,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:56:38,372 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 12:56:38,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:56:38,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:56:38,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:56:38,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:56:38,398 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:56:38,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:56:38,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:56:38,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:56:38,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:56:38,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:56:38,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:56:38,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:56:38,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:56:38,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:56:38,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:56:38,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:56:38,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:56:38,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:56:38,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:56:38,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:56:38,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:56:38,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:56:38,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:56:38,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:56:38,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:56:38,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:56:38,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:56:38,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:56:38,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:56:38,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:56:38,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:56:38,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:56:38,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:56:38,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:56:38,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:56:38,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.oepc.i [2019-12-18 12:56:38,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa49c7fb/73a0ed332a504e18b0c08e7649f1ccc3/FLAG1bd6d0de9 [2019-12-18 12:56:39,329 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:56:39,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.oepc.i [2019-12-18 12:56:39,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa49c7fb/73a0ed332a504e18b0c08e7649f1ccc3/FLAG1bd6d0de9 [2019-12-18 12:56:39,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa49c7fb/73a0ed332a504e18b0c08e7649f1ccc3 [2019-12-18 12:56:39,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:56:39,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:56:39,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:39,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:56:39,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:56:39,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:39" (1/1) ... [2019-12-18 12:56:39,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:39, skipping insertion in model container [2019-12-18 12:56:39,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:56:39" (1/1) ... [2019-12-18 12:56:39,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:56:39,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:56:40,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:40,275 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:56:40,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:56:40,414 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:56:40,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40 WrapperNode [2019-12-18 12:56:40,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:56:40,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:40,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:56:40,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:56:40,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:56:40,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:56:40,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:56:40,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:56:40,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (1/1) ... [2019-12-18 12:56:40,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:56:40,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:56:40,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:56:40,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:56:40,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (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 12:56:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:56:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:56:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:56:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:56:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:56:40,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:56:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:56:40,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:56:40,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:56:40,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:56:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:56:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:56:40,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:56:40,573 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 12:56:41,352 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:56:41,352 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:56:41,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:41 BoogieIcfgContainer [2019-12-18 12:56:41,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:56:41,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:56:41,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:56:41,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:56:41,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:56:39" (1/3) ... [2019-12-18 12:56:41,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4550b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:41, skipping insertion in model container [2019-12-18 12:56:41,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:56:40" (2/3) ... [2019-12-18 12:56:41,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4550b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:41, skipping insertion in model container [2019-12-18 12:56:41,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:41" (3/3) ... [2019-12-18 12:56:41,364 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.oepc.i [2019-12-18 12:56:41,373 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:56:41,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:56:41,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:56:41,383 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:56:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,433 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,433 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,441 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,478 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,479 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:56:41,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:56:41,578 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:56:41,578 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:56:41,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:56:41,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:56:41,579 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:56:41,579 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:56:41,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:56:41,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:56:41,592 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:56:41,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:56:41,684 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:56:41,684 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:41,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:56:41,738 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:56:41,786 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:56:41,787 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:56:41,800 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:56:41,828 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:56:41,829 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:56:46,489 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-18 12:56:47,152 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:56:47,275 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:56:47,527 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:56:47,527 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:56:47,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:57:08,747 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:57:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:57:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:57:08,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:08,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:57:08,755 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 12:57:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:57:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:08,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759732171] [2019-12-18 12:57:08,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:09,046 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 12:57:09,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759732171] [2019-12-18 12:57:09,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:09,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:57:09,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868197233] [2019-12-18 12:57:09,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:09,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:09,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:09,079 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:57:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:10,415 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:57:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:10,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:57:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:11,136 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:57:11,136 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:57:11,137 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 12:57:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:57:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:57:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:57:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:57:24,151 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:57:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:24,152 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:57:24,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:57:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:57:24,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:24,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:24,157 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 12:57:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:57:24,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:24,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483588237] [2019-12-18 12:57:24,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:24,245 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 12:57:24,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483588237] [2019-12-18 12:57:24,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:24,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:24,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122803394] [2019-12-18 12:57:24,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:24,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:24,249 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:57:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:29,415 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:57:29,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:29,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:57:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:29,944 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:57:29,944 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:57:29,945 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 12:57:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:57:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:57:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:57:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:57:45,570 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:57:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:45,571 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:57:45,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:57:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:57:45,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:45,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:45,577 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 12:57:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:57:45,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:45,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467567813] [2019-12-18 12:57:45,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:45,635 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 12:57:45,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467567813] [2019-12-18 12:57:45,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:45,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:45,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303136477] [2019-12-18 12:57:45,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:45,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:45,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:45,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:45,637 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:57:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:45,775 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:57:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:45,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:57:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:45,880 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:57:45,880 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:57:45,881 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 12:57:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:57:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:57:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:57:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:57:46,789 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:57:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:46,790 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:57:46,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:57:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:46,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:46,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:46,794 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 12:57:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:57:46,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567358837] [2019-12-18 12:57:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:46,884 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 12:57:46,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567358837] [2019-12-18 12:57:46,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:46,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:46,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558650792] [2019-12-18 12:57:46,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:57:46,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:46,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:57:46,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:57:46,886 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:57:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:47,090 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:57:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:57:47,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:57:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:47,236 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:57:47,236 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:57:47,237 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 12:57:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:57:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:57:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:57:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:57:49,120 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:57:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:49,121 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:57:49,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:57:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:57:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:49,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:49,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:49,125 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 12:57:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:57:49,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:49,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105931870] [2019-12-18 12:57:49,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:49,198 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 12:57:49,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105931870] [2019-12-18 12:57:49,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:49,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:49,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865603823] [2019-12-18 12:57:49,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:49,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:49,201 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:57:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:49,584 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:57:49,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:49,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:57:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:49,697 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:57:49,697 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:57:49,698 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 12:57:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:57:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:57:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:57:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:57:50,489 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:57:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:50,489 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:57:50,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:57:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:57:50,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:50,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:50,493 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 12:57:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:57:50,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:50,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881448229] [2019-12-18 12:57:50,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:50,558 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 12:57:50,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881448229] [2019-12-18 12:57:50,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:50,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:57:50,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130658237] [2019-12-18 12:57:50,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:50,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:50,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:50,561 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:57:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:50,933 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:57:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:57:50,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:57:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:51,068 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:57:51,068 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:57:51,069 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 12:57:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:57:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:57:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:57:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:57:52,399 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:57:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:52,399 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:57:52,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:57:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:57:52,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:52,408 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 12:57:52,408 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 12:57:52,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:52,409 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:57:52,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:52,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835212813] [2019-12-18 12:57:52,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:52,488 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 12:57:52,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835212813] [2019-12-18 12:57:52,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:52,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478072010] [2019-12-18 12:57:52,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:52,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:52,491 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:57:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:53,103 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:57:53,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:53,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:57:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:53,200 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:57:53,200 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:57:53,201 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 12:57:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:57:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:57:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:57:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:57:54,832 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:57:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:54,833 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:57:54,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:57:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:57:54,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:54,842 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 12:57:54,842 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 12:57:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:57:54,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:54,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658913457] [2019-12-18 12:57:54,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:54,906 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 12:57:54,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658913457] [2019-12-18 12:57:54,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:54,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:54,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352818051] [2019-12-18 12:57:54,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:54,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:54,908 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:57:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:55,542 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:57:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:57:55,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:57:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:55,659 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:57:55,659 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:57:55,660 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 12:57:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:57:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:57:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:57:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:57:56,575 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:57:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:56,575 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:57:56,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:57:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:57:56,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:56,588 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 12:57:56,588 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 12:57:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:57:56,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:56,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681278651] [2019-12-18 12:57:56,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:56,647 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 12:57:56,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681278651] [2019-12-18 12:57:56,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:56,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:56,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238277463] [2019-12-18 12:57:56,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:57:56,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:57:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:57:56,649 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:57:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:56,724 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:57:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:57:56,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:57:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:56,751 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:57:56,751 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:57:56,752 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 12:57:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:57:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:57:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:57:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:57:57,029 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:57:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:57,030 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:57:57,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:57:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:57:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:57:57,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:57,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:57:57,044 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 12:57:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:57,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:57:57,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:57,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204410427] [2019-12-18 12:57:57,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:57,102 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 12:57:57,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204410427] [2019-12-18 12:57:57,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:57,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:57,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878664787] [2019-12-18 12:57:57,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:57,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:57,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:57,105 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:57:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:57,435 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:57:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:57,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:57:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:57,467 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:57:57,467 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:57:57,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:57:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:57:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:57:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:57:58,071 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:57:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:58,072 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:57:58,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:57:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:57:58,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:58,086 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 12:57:58,087 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 12:57:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:57:58,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:58,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112702507] [2019-12-18 12:57:58,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:58,154 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 12:57:58,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112702507] [2019-12-18 12:57:58,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:58,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:57:58,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164868135] [2019-12-18 12:57:58,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:57:58,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:57:58,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:57:58,157 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:57:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:58,537 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:57:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:57:58,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:57:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:58,571 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:57:58,571 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:57:58,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:57:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:57:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:57:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:57:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:57:58,886 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:57:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:57:58,886 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:57:58,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:57:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:57:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:57:58,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:57:58,906 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] [2019-12-18 12:57:58,906 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 12:57:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:57:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:57:58,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:57:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718654682] [2019-12-18 12:57:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:57:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:57:58,982 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 12:57:58,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718654682] [2019-12-18 12:57:58,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:57:58,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:57:58,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126321312] [2019-12-18 12:57:58,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:57:58,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:57:58,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:57:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:57:58,985 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:57:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:57:59,674 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:57:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:57:59,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:57:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:57:59,737 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:57:59,738 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:57:59,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:57:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:58:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:58:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:58:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:58:00,268 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:58:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:00,269 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:58:00,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:58:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:58:00,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:00,298 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 12:58:00,298 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 12:58:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:58:00,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:00,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885958600] [2019-12-18 12:58:00,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:00,415 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 12:58:00,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885958600] [2019-12-18 12:58:00,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:00,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:00,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605385535] [2019-12-18 12:58:00,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:00,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:00,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:00,418 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:58:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:01,110 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:58:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:01,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:58:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:01,148 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:58:01,149 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:58:01,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:58:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:58:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:58:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:58:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:58:01,468 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:58:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:01,468 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:58:01,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:58:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:58:01,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:01,487 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 12:58:01,487 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 12:58:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:58:01,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:01,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027333825] [2019-12-18 12:58:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:01,552 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 12:58:01,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027333825] [2019-12-18 12:58:01,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:01,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:58:01,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746577670] [2019-12-18 12:58:01,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:01,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:01,554 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:58:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:01,627 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:58:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:01,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:58:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:01,661 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:58:01,661 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:58:01,661 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 12:58:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:58:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:58:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:58:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:58:02,293 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:58:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:02,294 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:58:02,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:58:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:02,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:02,312 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 12:58:02,312 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 12:58:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:58:02,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:02,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400328582] [2019-12-18 12:58:02,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:02,385 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 12:58:02,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400328582] [2019-12-18 12:58:02,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:02,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:58:02,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3585495] [2019-12-18 12:58:02,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:02,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:02,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:02,387 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:58:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:03,019 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:58:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:58:03,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:58:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:03,073 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:58:03,073 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:58:03,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:58:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:58:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:58:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:58:03,423 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:58:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:03,424 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:58:03,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:58:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:58:03,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:03,452 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 12:58:03,452 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 12:58:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:58:03,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:03,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365012428] [2019-12-18 12:58:03,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:03,513 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 12:58:03,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365012428] [2019-12-18 12:58:03,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:03,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:58:03,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214792656] [2019-12-18 12:58:03,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:58:03,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:58:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:58:03,515 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:58:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:03,622 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:58:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:58:03,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:58:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:03,660 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:58:03,660 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:58:03,661 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 12:58:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:58:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:58:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:58:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:58:03,976 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:58:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:03,977 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:58:03,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:58:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:58:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:04,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:04,005 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] [2019-12-18 12:58:04,005 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 12:58:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:58:04,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:04,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019188467] [2019-12-18 12:58:04,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:04,097 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 12:58:04,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019188467] [2019-12-18 12:58:04,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:04,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:04,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856476404] [2019-12-18 12:58:04,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:04,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:04,100 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:58:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:04,663 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:58:04,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:04,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:04,728 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:58:04,728 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:58:04,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:58:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:58:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:58:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:58:05,786 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:58:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:58:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:58:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:05,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:05,816 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] [2019-12-18 12:58:05,816 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 12:58:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:58:05,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:05,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619150207] [2019-12-18 12:58:05,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:05,921 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 12:58:05,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619150207] [2019-12-18 12:58:05,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:05,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:05,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020458616] [2019-12-18 12:58:05,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:05,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:05,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:05,923 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:58:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:06,630 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:58:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:58:06,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:06,704 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:58:06,704 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:58:06,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:58:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:58:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:58:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:58:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:58:07,371 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:58:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:07,371 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:58:07,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:58:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:07,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:07,405 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] [2019-12-18 12:58:07,406 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 12:58:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:58:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:07,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838707877] [2019-12-18 12:58:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:07,490 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 12:58:07,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838707877] [2019-12-18 12:58:07,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:07,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:07,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790455849] [2019-12-18 12:58:07,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:07,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:07,493 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:58:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:08,092 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:58:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:58:08,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:08,177 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:58:08,177 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:58:08,177 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 12:58:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:58:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:58:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:58:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:58:08,816 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:58:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:08,816 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:58:08,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:58:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:08,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:08,848 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] [2019-12-18 12:58:08,848 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 12:58:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:58:08,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:08,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387376198] [2019-12-18 12:58:08,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:09,005 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 12:58:09,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387376198] [2019-12-18 12:58:09,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:09,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:09,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971338442] [2019-12-18 12:58:09,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:09,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:09,007 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 9 states. [2019-12-18 12:58:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:10,759 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-18 12:58:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:58:10,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:10,813 INFO L225 Difference]: With dead ends: 38094 [2019-12-18 12:58:10,813 INFO L226 Difference]: Without dead ends: 37870 [2019-12-18 12:58:10,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:58:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-18 12:58:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-18 12:58:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-18 12:58:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-18 12:58:11,357 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-18 12:58:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:11,357 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-18 12:58:11,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-18 12:58:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:11,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:11,393 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] [2019-12-18 12:58:11,393 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 12:58:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 12:58:11,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:11,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748555446] [2019-12-18 12:58:11,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:11,499 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 12:58:11,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748555446] [2019-12-18 12:58:11,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:11,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:11,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258809016] [2019-12-18 12:58:11,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:11,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:11,503 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 7 states. [2019-12-18 12:58:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:13,152 INFO L93 Difference]: Finished difference Result 54976 states and 166682 transitions. [2019-12-18 12:58:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:58:13,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:13,238 INFO L225 Difference]: With dead ends: 54976 [2019-12-18 12:58:13,238 INFO L226 Difference]: Without dead ends: 54653 [2019-12-18 12:58:13,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:58:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54653 states. [2019-12-18 12:58:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54653 to 34658. [2019-12-18 12:58:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-12-18 12:58:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 107721 transitions. [2019-12-18 12:58:13,941 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 107721 transitions. Word has length 63 [2019-12-18 12:58:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:13,941 INFO L462 AbstractCegarLoop]: Abstraction has 34658 states and 107721 transitions. [2019-12-18 12:58:13,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 107721 transitions. [2019-12-18 12:58:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:13,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:13,981 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] [2019-12-18 12:58:13,981 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 12:58:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 12:58:13,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:13,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024913378] [2019-12-18 12:58:13,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:14,090 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 12:58:14,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024913378] [2019-12-18 12:58:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:14,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:58:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838578692] [2019-12-18 12:58:14,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:58:14,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:58:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:58:14,097 INFO L87 Difference]: Start difference. First operand 34658 states and 107721 transitions. Second operand 7 states. [2019-12-18 12:58:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:15,425 INFO L93 Difference]: Finished difference Result 57288 states and 175480 transitions. [2019-12-18 12:58:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:58:15,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:58:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:15,518 INFO L225 Difference]: With dead ends: 57288 [2019-12-18 12:58:15,518 INFO L226 Difference]: Without dead ends: 57068 [2019-12-18 12:58:15,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2019-12-18 12:58:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 40390. [2019-12-18 12:58:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40390 states. [2019-12-18 12:58:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40390 states to 40390 states and 125252 transitions. [2019-12-18 12:58:16,333 INFO L78 Accepts]: Start accepts. Automaton has 40390 states and 125252 transitions. Word has length 63 [2019-12-18 12:58:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:16,333 INFO L462 AbstractCegarLoop]: Abstraction has 40390 states and 125252 transitions. [2019-12-18 12:58:16,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:58:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40390 states and 125252 transitions. [2019-12-18 12:58:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:16,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:16,384 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] [2019-12-18 12:58:16,384 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 12:58:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 12:58:16,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:16,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772830840] [2019-12-18 12:58:16,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:16,525 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 12:58:16,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772830840] [2019-12-18 12:58:16,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:16,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:16,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429052283] [2019-12-18 12:58:16,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:16,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:16,528 INFO L87 Difference]: Start difference. First operand 40390 states and 125252 transitions. Second operand 8 states. [2019-12-18 12:58:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:17,834 INFO L93 Difference]: Finished difference Result 60008 states and 183321 transitions. [2019-12-18 12:58:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:58:17,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:17,922 INFO L225 Difference]: With dead ends: 60008 [2019-12-18 12:58:17,922 INFO L226 Difference]: Without dead ends: 59756 [2019-12-18 12:58:17,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:58:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-18 12:58:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40339. [2019-12-18 12:58:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40339 states. [2019-12-18 12:58:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40339 states to 40339 states and 125109 transitions. [2019-12-18 12:58:18,778 INFO L78 Accepts]: Start accepts. Automaton has 40339 states and 125109 transitions. Word has length 63 [2019-12-18 12:58:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:18,778 INFO L462 AbstractCegarLoop]: Abstraction has 40339 states and 125109 transitions. [2019-12-18 12:58:18,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40339 states and 125109 transitions. [2019-12-18 12:58:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:18,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:18,830 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] [2019-12-18 12:58:18,831 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 12:58:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 12:58:18,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:18,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720528721] [2019-12-18 12:58:18,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:19,472 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 12:58:19,514 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 12:58:19,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720528721] [2019-12-18 12:58:19,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:19,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:19,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925721372] [2019-12-18 12:58:19,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:19,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:19,516 INFO L87 Difference]: Start difference. First operand 40339 states and 125109 transitions. Second operand 8 states. [2019-12-18 12:58:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:21,428 INFO L93 Difference]: Finished difference Result 58458 states and 177165 transitions. [2019-12-18 12:58:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:21,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:58:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:21,521 INFO L225 Difference]: With dead ends: 58458 [2019-12-18 12:58:21,521 INFO L226 Difference]: Without dead ends: 58458 [2019-12-18 12:58:21,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:58:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58458 states. [2019-12-18 12:58:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58458 to 39692. [2019-12-18 12:58:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39692 states. [2019-12-18 12:58:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 123217 transitions. [2019-12-18 12:58:22,338 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 123217 transitions. Word has length 63 [2019-12-18 12:58:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:22,338 INFO L462 AbstractCegarLoop]: Abstraction has 39692 states and 123217 transitions. [2019-12-18 12:58:22,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 123217 transitions. [2019-12-18 12:58:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:22,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:22,380 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] [2019-12-18 12:58:22,380 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 12:58:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 12:58:22,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:22,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554426816] [2019-12-18 12:58:22,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:22,511 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 12:58:22,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554426816] [2019-12-18 12:58:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:22,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647156807] [2019-12-18 12:58:22,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:58:22,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:58:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:58:22,512 INFO L87 Difference]: Start difference. First operand 39692 states and 123217 transitions. Second operand 9 states. [2019-12-18 12:58:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:23,671 INFO L93 Difference]: Finished difference Result 55159 states and 169085 transitions. [2019-12-18 12:58:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:58:23,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 12:58:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:23,758 INFO L225 Difference]: With dead ends: 55159 [2019-12-18 12:58:23,758 INFO L226 Difference]: Without dead ends: 55159 [2019-12-18 12:58:23,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:58:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55159 states. [2019-12-18 12:58:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55159 to 38889. [2019-12-18 12:58:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38889 states. [2019-12-18 12:58:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38889 states to 38889 states and 120766 transitions. [2019-12-18 12:58:25,216 INFO L78 Accepts]: Start accepts. Automaton has 38889 states and 120766 transitions. Word has length 63 [2019-12-18 12:58:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:25,216 INFO L462 AbstractCegarLoop]: Abstraction has 38889 states and 120766 transitions. [2019-12-18 12:58:25,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:58:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38889 states and 120766 transitions. [2019-12-18 12:58:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:58:25,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:25,259 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] [2019-12-18 12:58:25,259 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 12:58:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 12:58:25,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:25,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162365187] [2019-12-18 12:58:25,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:25,312 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 12:58:25,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162365187] [2019-12-18 12:58:25,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:25,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:25,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871900446] [2019-12-18 12:58:25,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:25,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:25,315 INFO L87 Difference]: Start difference. First operand 38889 states and 120766 transitions. Second operand 3 states. [2019-12-18 12:58:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:25,493 INFO L93 Difference]: Finished difference Result 38888 states and 120764 transitions. [2019-12-18 12:58:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:25,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:58:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:25,574 INFO L225 Difference]: With dead ends: 38888 [2019-12-18 12:58:25,574 INFO L226 Difference]: Without dead ends: 38888 [2019-12-18 12:58:25,574 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 12:58:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38888 states. [2019-12-18 12:58:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38888 to 33168. [2019-12-18 12:58:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33168 states. [2019-12-18 12:58:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33168 states to 33168 states and 104136 transitions. [2019-12-18 12:58:26,150 INFO L78 Accepts]: Start accepts. Automaton has 33168 states and 104136 transitions. Word has length 63 [2019-12-18 12:58:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:26,150 INFO L462 AbstractCegarLoop]: Abstraction has 33168 states and 104136 transitions. [2019-12-18 12:58:26,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33168 states and 104136 transitions. [2019-12-18 12:58:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:58:26,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:26,187 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 12:58:26,188 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 12:58:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-18 12:58:26,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:26,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873186806] [2019-12-18 12:58:26,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:26,256 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 12:58:26,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873186806] [2019-12-18 12:58:26,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:26,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:58:26,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791993228] [2019-12-18 12:58:26,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:58:26,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:26,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:58:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:58:26,258 INFO L87 Difference]: Start difference. First operand 33168 states and 104136 transitions. Second operand 3 states. [2019-12-18 12:58:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:26,394 INFO L93 Difference]: Finished difference Result 25051 states and 77745 transitions. [2019-12-18 12:58:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:26,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:58:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:26,444 INFO L225 Difference]: With dead ends: 25051 [2019-12-18 12:58:26,445 INFO L226 Difference]: Without dead ends: 25051 [2019-12-18 12:58:26,445 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 12:58:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25051 states. [2019-12-18 12:58:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25051 to 23173. [2019-12-18 12:58:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23173 states. [2019-12-18 12:58:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23173 states to 23173 states and 71817 transitions. [2019-12-18 12:58:26,811 INFO L78 Accepts]: Start accepts. Automaton has 23173 states and 71817 transitions. Word has length 64 [2019-12-18 12:58:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:26,811 INFO L462 AbstractCegarLoop]: Abstraction has 23173 states and 71817 transitions. [2019-12-18 12:58:26,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:58:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23173 states and 71817 transitions. [2019-12-18 12:58:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:26,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:26,836 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 12:58:26,836 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 12:58:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-18 12:58:26,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:26,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077921229] [2019-12-18 12:58:26,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:26,906 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 12:58:26,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077921229] [2019-12-18 12:58:26,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:26,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:58:26,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422917670] [2019-12-18 12:58:26,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:58:26,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:58:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:58:26,908 INFO L87 Difference]: Start difference. First operand 23173 states and 71817 transitions. Second operand 6 states. [2019-12-18 12:58:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:27,765 INFO L93 Difference]: Finished difference Result 33354 states and 101850 transitions. [2019-12-18 12:58:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:58:27,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 12:58:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:27,812 INFO L225 Difference]: With dead ends: 33354 [2019-12-18 12:58:27,812 INFO L226 Difference]: Without dead ends: 33354 [2019-12-18 12:58:27,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33354 states. [2019-12-18 12:58:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33354 to 25362. [2019-12-18 12:58:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25362 states. [2019-12-18 12:58:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25362 states to 25362 states and 78503 transitions. [2019-12-18 12:58:28,269 INFO L78 Accepts]: Start accepts. Automaton has 25362 states and 78503 transitions. Word has length 65 [2019-12-18 12:58:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:28,270 INFO L462 AbstractCegarLoop]: Abstraction has 25362 states and 78503 transitions. [2019-12-18 12:58:28,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:58:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25362 states and 78503 transitions. [2019-12-18 12:58:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:28,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:28,297 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 12:58:28,297 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 12:58:28,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-18 12:58:28,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:28,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186778849] [2019-12-18 12:58:28,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:28,470 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 12:58:28,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186778849] [2019-12-18 12:58:28,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:28,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:28,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638727573] [2019-12-18 12:58:28,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:28,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:28,473 INFO L87 Difference]: Start difference. First operand 25362 states and 78503 transitions. Second operand 11 states. [2019-12-18 12:58:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:30,119 INFO L93 Difference]: Finished difference Result 54811 states and 169710 transitions. [2019-12-18 12:58:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:58:30,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:30,198 INFO L225 Difference]: With dead ends: 54811 [2019-12-18 12:58:30,199 INFO L226 Difference]: Without dead ends: 52257 [2019-12-18 12:58:30,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:58:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52257 states. [2019-12-18 12:58:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52257 to 30805. [2019-12-18 12:58:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30805 states. [2019-12-18 12:58:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30805 states to 30805 states and 95140 transitions. [2019-12-18 12:58:30,852 INFO L78 Accepts]: Start accepts. Automaton has 30805 states and 95140 transitions. Word has length 65 [2019-12-18 12:58:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:30,853 INFO L462 AbstractCegarLoop]: Abstraction has 30805 states and 95140 transitions. [2019-12-18 12:58:30,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 30805 states and 95140 transitions. [2019-12-18 12:58:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:30,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:30,887 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 12:58:30,887 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 3 times [2019-12-18 12:58:30,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:30,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102984089] [2019-12-18 12:58:30,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:30,993 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 12:58:30,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102984089] [2019-12-18 12:58:30,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:30,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:30,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022981009] [2019-12-18 12:58:30,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:58:30,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:58:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:58:30,995 INFO L87 Difference]: Start difference. First operand 30805 states and 95140 transitions. Second operand 8 states. [2019-12-18 12:58:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:32,593 INFO L93 Difference]: Finished difference Result 41716 states and 126524 transitions. [2019-12-18 12:58:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:58:32,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:58:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:32,655 INFO L225 Difference]: With dead ends: 41716 [2019-12-18 12:58:32,655 INFO L226 Difference]: Without dead ends: 41716 [2019-12-18 12:58:32,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:58:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41716 states. [2019-12-18 12:58:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41716 to 29158. [2019-12-18 12:58:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29158 states. [2019-12-18 12:58:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29158 states to 29158 states and 90135 transitions. [2019-12-18 12:58:33,214 INFO L78 Accepts]: Start accepts. Automaton has 29158 states and 90135 transitions. Word has length 65 [2019-12-18 12:58:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:33,214 INFO L462 AbstractCegarLoop]: Abstraction has 29158 states and 90135 transitions. [2019-12-18 12:58:33,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:58:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29158 states and 90135 transitions. [2019-12-18 12:58:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:33,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:33,247 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 12:58:33,247 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1623072545, now seen corresponding path program 4 times [2019-12-18 12:58:33,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:33,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436152820] [2019-12-18 12:58:33,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:58:33,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436152820] [2019-12-18 12:58:33,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:33,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:58:33,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932520836] [2019-12-18 12:58:33,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:58:33,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:58:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:58:33,461 INFO L87 Difference]: Start difference. First operand 29158 states and 90135 transitions. Second operand 10 states. [2019-12-18 12:58:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:34,746 INFO L93 Difference]: Finished difference Result 37967 states and 116407 transitions. [2019-12-18 12:58:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:58:34,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:58:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:34,797 INFO L225 Difference]: With dead ends: 37967 [2019-12-18 12:58:34,797 INFO L226 Difference]: Without dead ends: 33322 [2019-12-18 12:58:34,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:58:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33322 states. [2019-12-18 12:58:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33322 to 28612. [2019-12-18 12:58:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28612 states. [2019-12-18 12:58:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28612 states to 28612 states and 88154 transitions. [2019-12-18 12:58:35,704 INFO L78 Accepts]: Start accepts. Automaton has 28612 states and 88154 transitions. Word has length 65 [2019-12-18 12:58:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:35,705 INFO L462 AbstractCegarLoop]: Abstraction has 28612 states and 88154 transitions. [2019-12-18 12:58:35,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:58:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28612 states and 88154 transitions. [2019-12-18 12:58:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:35,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:35,735 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 12:58:35,736 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1136252595, now seen corresponding path program 5 times [2019-12-18 12:58:35,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:35,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370679153] [2019-12-18 12:58:35,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:35,945 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 12:58:35,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370679153] [2019-12-18 12:58:35,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:35,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:35,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083529195] [2019-12-18 12:58:35,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:35,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:35,947 INFO L87 Difference]: Start difference. First operand 28612 states and 88154 transitions. Second operand 11 states. [2019-12-18 12:58:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:37,287 INFO L93 Difference]: Finished difference Result 37616 states and 114417 transitions. [2019-12-18 12:58:37,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:58:37,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:37,340 INFO L225 Difference]: With dead ends: 37616 [2019-12-18 12:58:37,341 INFO L226 Difference]: Without dead ends: 34634 [2019-12-18 12:58:37,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:58:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34634 states. [2019-12-18 12:58:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34634 to 28634. [2019-12-18 12:58:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28634 states. [2019-12-18 12:58:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28634 states to 28634 states and 87955 transitions. [2019-12-18 12:58:37,825 INFO L78 Accepts]: Start accepts. Automaton has 28634 states and 87955 transitions. Word has length 65 [2019-12-18 12:58:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:37,825 INFO L462 AbstractCegarLoop]: Abstraction has 28634 states and 87955 transitions. [2019-12-18 12:58:37,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28634 states and 87955 transitions. [2019-12-18 12:58:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:37,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:37,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:58:37,856 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 6 times [2019-12-18 12:58:37,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:37,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161382792] [2019-12-18 12:58:37,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:38,026 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 12:58:38,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161382792] [2019-12-18 12:58:38,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:38,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:38,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467206064] [2019-12-18 12:58:38,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:38,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:38,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:38,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:38,028 INFO L87 Difference]: Start difference. First operand 28634 states and 87955 transitions. Second operand 11 states. [2019-12-18 12:58:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:39,249 INFO L93 Difference]: Finished difference Result 48715 states and 148746 transitions. [2019-12-18 12:58:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:39,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:39,309 INFO L225 Difference]: With dead ends: 48715 [2019-12-18 12:58:39,309 INFO L226 Difference]: Without dead ends: 40916 [2019-12-18 12:58:39,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:58:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40916 states. [2019-12-18 12:58:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40916 to 24044. [2019-12-18 12:58:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24044 states. [2019-12-18 12:58:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24044 states to 24044 states and 73978 transitions. [2019-12-18 12:58:39,803 INFO L78 Accepts]: Start accepts. Automaton has 24044 states and 73978 transitions. Word has length 65 [2019-12-18 12:58:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:39,804 INFO L462 AbstractCegarLoop]: Abstraction has 24044 states and 73978 transitions. [2019-12-18 12:58:39,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24044 states and 73978 transitions. [2019-12-18 12:58:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:39,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:39,830 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 12:58:39,830 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1664741459, now seen corresponding path program 7 times [2019-12-18 12:58:39,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:39,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802447758] [2019-12-18 12:58:39,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:40,001 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 12:58:40,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802447758] [2019-12-18 12:58:40,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:40,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:58:40,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686188388] [2019-12-18 12:58:40,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:58:40,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:58:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:58:40,003 INFO L87 Difference]: Start difference. First operand 24044 states and 73978 transitions. Second operand 11 states. [2019-12-18 12:58:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:41,264 INFO L93 Difference]: Finished difference Result 28164 states and 85971 transitions. [2019-12-18 12:58:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:58:41,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:58:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:41,305 INFO L225 Difference]: With dead ends: 28164 [2019-12-18 12:58:41,305 INFO L226 Difference]: Without dead ends: 27274 [2019-12-18 12:58:41,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:58:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27274 states. [2019-12-18 12:58:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27274 to 23644. [2019-12-18 12:58:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23644 states. [2019-12-18 12:58:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23644 states to 23644 states and 72827 transitions. [2019-12-18 12:58:42,087 INFO L78 Accepts]: Start accepts. Automaton has 23644 states and 72827 transitions. Word has length 65 [2019-12-18 12:58:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:42,088 INFO L462 AbstractCegarLoop]: Abstraction has 23644 states and 72827 transitions. [2019-12-18 12:58:42,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:58:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23644 states and 72827 transitions. [2019-12-18 12:58:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:58:42,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:42,110 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 12:58:42,111 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 8 times [2019-12-18 12:58:42,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:42,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934545039] [2019-12-18 12:58:42,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:42,189 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 12:58:42,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934545039] [2019-12-18 12:58:42,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:42,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:58:42,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248189778] [2019-12-18 12:58:42,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:58:42,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:58:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:58:42,191 INFO L87 Difference]: Start difference. First operand 23644 states and 72827 transitions. Second operand 4 states. [2019-12-18 12:58:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:42,322 INFO L93 Difference]: Finished difference Result 27891 states and 85573 transitions. [2019-12-18 12:58:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:58:42,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:58:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:42,358 INFO L225 Difference]: With dead ends: 27891 [2019-12-18 12:58:42,358 INFO L226 Difference]: Without dead ends: 27891 [2019-12-18 12:58:42,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 12:58:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2019-12-18 12:58:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 23748. [2019-12-18 12:58:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2019-12-18 12:58:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 73329 transitions. [2019-12-18 12:58:42,744 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 73329 transitions. Word has length 65 [2019-12-18 12:58:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 23748 states and 73329 transitions. [2019-12-18 12:58:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:58:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 73329 transitions. [2019-12-18 12:58:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:58:42,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:42,767 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 12:58:42,767 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-18 12:58:42,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:42,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984533186] [2019-12-18 12:58:42,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:58:42,916 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 12:58:42,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984533186] [2019-12-18 12:58:42,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:58:42,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:58:42,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678672415] [2019-12-18 12:58:42,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:58:42,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:58:42,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:58:42,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:58:42,918 INFO L87 Difference]: Start difference. First operand 23748 states and 73329 transitions. Second operand 12 states. [2019-12-18 12:58:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:58:43,920 INFO L93 Difference]: Finished difference Result 40786 states and 125683 transitions. [2019-12-18 12:58:43,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:58:43,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:58:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:58:43,982 INFO L225 Difference]: With dead ends: 40786 [2019-12-18 12:58:43,982 INFO L226 Difference]: Without dead ends: 40311 [2019-12-18 12:58:43,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:58:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40311 states. [2019-12-18 12:58:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40311 to 23480. [2019-12-18 12:58:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23480 states. [2019-12-18 12:58:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23480 states to 23480 states and 72641 transitions. [2019-12-18 12:58:44,469 INFO L78 Accepts]: Start accepts. Automaton has 23480 states and 72641 transitions. Word has length 66 [2019-12-18 12:58:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:58:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 23480 states and 72641 transitions. [2019-12-18 12:58:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:58:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23480 states and 72641 transitions. [2019-12-18 12:58:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:58:44,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:58:44,497 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 12:58:44,497 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:58:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:58:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-18 12:58:44,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:58:44,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147466230] [2019-12-18 12:58:44,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:58:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:58:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:58:44,604 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:58:44,604 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:58:44,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t675~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t675~0.base_22|) |v_ULTIMATE.start_main_~#t675~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t675~0.base_22|)) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= v_~z$read_delayed~0_7 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t675~0.base_22| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t675~0.base_22|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t675~0.base_22| 4) |v_#length_21|) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= 0 |v_ULTIMATE.start_main_~#t675~0.offset_16|) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t677~0.base=|v_ULTIMATE.start_main_~#t677~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_~#t675~0.offset=|v_ULTIMATE.start_main_~#t675~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_~#t675~0.base=|v_ULTIMATE.start_main_~#t675~0.base_22|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t676~0.offset=|v_ULTIMATE.start_main_~#t676~0.offset_14|, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t676~0.base=|v_ULTIMATE.start_main_~#t676~0.base_19|, ULTIMATE.start_main_~#t677~0.offset=|v_ULTIMATE.start_main_~#t677~0.offset_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t677~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t675~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t675~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t676~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t676~0.base, ULTIMATE.start_main_~#t677~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:58:44,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:58:44,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t676~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t676~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t676~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t676~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t676~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t676~0.base_11|) |v_ULTIMATE.start_main_~#t676~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t676~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t676~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t676~0.offset=|v_ULTIMATE.start_main_~#t676~0.offset_10|, ULTIMATE.start_main_~#t676~0.base=|v_ULTIMATE.start_main_~#t676~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t676~0.offset, ULTIMATE.start_main_~#t676~0.base] because there is no mapped edge [2019-12-18 12:58:44,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (not (= |v_ULTIMATE.start_main_~#t677~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t677~0.base_12|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t677~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t677~0.offset_10|) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t677~0.base_12| 1) |v_#valid_29|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t677~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t677~0.base_12|) |v_ULTIMATE.start_main_~#t677~0.offset_10| 2)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t677~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t677~0.offset=|v_ULTIMATE.start_main_~#t677~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t677~0.base=|v_ULTIMATE.start_main_~#t677~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t677~0.offset, ULTIMATE.start_main_~#t677~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:58:44,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1701431211| |P1Thread1of1ForFork2_#t~ite10_Out-1701431211|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1701431211 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1701431211 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1701431211| ~z$w_buff1~0_In-1701431211) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1701431211| ~z~0_In-1701431211)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701431211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701431211, ~z$w_buff1~0=~z$w_buff1~0_In-1701431211, ~z~0=~z~0_In-1701431211} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1701431211|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1701431211, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1701431211|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701431211, ~z$w_buff1~0=~z$w_buff1~0_In-1701431211, ~z~0=~z~0_In-1701431211} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:58:44,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-726133103 256)))) (or (and (= ~z$w_buff1~0_In-726133103 |P2Thread1of1ForFork0_#t~ite23_Out-726133103|) (= |P2Thread1of1ForFork0_#t~ite23_Out-726133103| |P2Thread1of1ForFork0_#t~ite24_Out-726133103|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-726133103 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-726133103 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In-726133103 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-726133103 256)))) .cse1) (and (= ~z$w_buff1~0_In-726133103 |P2Thread1of1ForFork0_#t~ite24_Out-726133103|) (= |P2Thread1of1ForFork0_#t~ite23_In-726133103| |P2Thread1of1ForFork0_#t~ite23_Out-726133103|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-726133103, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-726133103, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-726133103|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-726133103, ~z$w_buff1~0=~z$w_buff1~0_In-726133103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-726133103, ~weak$$choice2~0=~weak$$choice2~0_In-726133103} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-726133103, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-726133103|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-726133103, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-726133103|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-726133103, ~z$w_buff1~0=~z$w_buff1~0_In-726133103, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-726133103, ~weak$$choice2~0=~weak$$choice2~0_In-726133103} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:58:44,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-264998810 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-264998810 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-264998810 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-264998810 256))) (.cse4 (= (mod ~z$w_buff1_used~0_In-264998810 256) 0)) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-264998810| |P2Thread1of1ForFork0_#t~ite30_Out-264998810|))) (or (let ((.cse2 (not .cse6))) (and (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-264998810|) (not .cse0) .cse1 (or .cse2 (not .cse3)) (or .cse2 (not .cse4)) .cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-264998810| |P2Thread1of1ForFork0_#t~ite28_Out-264998810|))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-264998810| |P2Thread1of1ForFork0_#t~ite29_In-264998810|) (not .cse1) (= ~z$w_buff1_used~0_In-264998810 |P2Thread1of1ForFork0_#t~ite30_Out-264998810|)) (and .cse1 (or (and .cse6 .cse3) .cse0 (and .cse6 .cse4)) (= |P2Thread1of1ForFork0_#t~ite29_Out-264998810| ~z$w_buff1_used~0_In-264998810) .cse5)) (= |P2Thread1of1ForFork0_#t~ite28_In-264998810| |P2Thread1of1ForFork0_#t~ite28_Out-264998810|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-264998810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-264998810, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-264998810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-264998810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-264998810, ~weak$$choice2~0=~weak$$choice2~0_In-264998810, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-264998810|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-264998810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-264998810, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-264998810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-264998810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-264998810, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-264998810|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-264998810|, ~weak$$choice2~0=~weak$$choice2~0_In-264998810} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:58:44,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:58:44,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:58:44,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1068097559| |P2Thread1of1ForFork0_#t~ite38_Out-1068097559|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1068097559 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1068097559 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-1068097559| ~z~0_In-1068097559)) (and .cse2 (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1068097559| ~z$w_buff1~0_In-1068097559)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1068097559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068097559, ~z$w_buff1~0=~z$w_buff1~0_In-1068097559, ~z~0=~z~0_In-1068097559} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1068097559|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1068097559|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1068097559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1068097559, ~z$w_buff1~0=~z$w_buff1~0_In-1068097559, ~z~0=~z~0_In-1068097559} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:58:44,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In536309496 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In536309496 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out536309496| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out536309496| ~z$w_buff0_used~0_In536309496) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In536309496, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In536309496} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In536309496, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out536309496|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In536309496} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:58:44,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In949349969 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In949349969 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In949349969 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In949349969 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out949349969| ~z$w_buff1_used~0_In949349969) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out949349969|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In949349969, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In949349969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In949349969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In949349969} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In949349969, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In949349969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In949349969, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In949349969, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out949349969|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:58:44,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-217273266 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-217273266 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-217273266|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-217273266 |P2Thread1of1ForFork0_#t~ite42_Out-217273266|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-217273266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-217273266} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-217273266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-217273266, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-217273266|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:58:44,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1752027516 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1752027516 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1752027516 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1752027516 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1752027516 |P2Thread1of1ForFork0_#t~ite43_Out-1752027516|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1752027516| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1752027516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1752027516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1752027516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1752027516} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1752027516|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1752027516, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1752027516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1752027516, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1752027516} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:58:44,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:58:44,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1181587382 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1181587382 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1181587382| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1181587382| ~z$w_buff0_used~0_In-1181587382) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1181587382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1181587382} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1181587382|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1181587382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1181587382} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:58:44,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2065908462 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2065908462 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2065908462 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In2065908462 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2065908462 |P0Thread1of1ForFork1_#t~ite6_Out2065908462|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2065908462|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2065908462, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2065908462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2065908462, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2065908462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2065908462, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2065908462|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2065908462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2065908462, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2065908462} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:58:44,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1289904625 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1289904625 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-1289904625 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-1289904625 ~z$r_buff0_thd1~0_In-1289904625) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1289904625, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1289904625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1289904625, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1289904625|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1289904625} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:58:44,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1280644344 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1280644344 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1280644344 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1280644344 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1280644344| ~z$r_buff1_thd1~0_In1280644344)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out1280644344| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1280644344, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1280644344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1280644344, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1280644344} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1280644344|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1280644344, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1280644344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1280644344, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1280644344} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:58:44,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:58:44,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-192212989 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-192212989 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-192212989| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-192212989| ~z$w_buff0_used~0_In-192212989) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-192212989, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-192212989} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-192212989, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-192212989|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-192212989} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:58:44,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In489222260 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In489222260 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In489222260 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In489222260 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out489222260| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out489222260| ~z$w_buff1_used~0_In489222260) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In489222260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In489222260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In489222260, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In489222260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In489222260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In489222260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In489222260, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out489222260|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In489222260} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:58:44,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-253575822 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-253575822 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-253575822 |P1Thread1of1ForFork2_#t~ite13_Out-253575822|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-253575822| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-253575822, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-253575822} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-253575822, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-253575822|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-253575822} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:58:44,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In821819034 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In821819034 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In821819034 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In821819034 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In821819034 |P1Thread1of1ForFork2_#t~ite14_Out821819034|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out821819034| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In821819034, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In821819034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821819034, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In821819034} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In821819034, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In821819034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821819034, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out821819034|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In821819034} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:58:44,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:58:44,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:58:44,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1078751235 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1078751235 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1078751235| ~z~0_In-1078751235)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1078751235| ~z$w_buff1~0_In-1078751235) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1078751235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1078751235, ~z$w_buff1~0=~z$w_buff1~0_In-1078751235, ~z~0=~z~0_In-1078751235} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1078751235, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1078751235|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1078751235, ~z$w_buff1~0=~z$w_buff1~0_In-1078751235, ~z~0=~z~0_In-1078751235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:58:44,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:58:44,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-116810035 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-116810035 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-116810035|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-116810035 |ULTIMATE.start_main_#t~ite49_Out-116810035|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-116810035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-116810035} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-116810035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-116810035, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-116810035|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:58:44,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In161164027 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In161164027 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In161164027 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In161164027 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out161164027| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out161164027| ~z$w_buff1_used~0_In161164027) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In161164027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In161164027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In161164027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In161164027} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out161164027|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In161164027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In161164027, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In161164027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In161164027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:58:44,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1129516232 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1129516232 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1129516232|)) (and (= ~z$r_buff0_thd0~0_In1129516232 |ULTIMATE.start_main_#t~ite51_Out1129516232|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1129516232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1129516232} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1129516232, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1129516232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1129516232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:58:44,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2070134712 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2070134712 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2070134712 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2070134712 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-2070134712| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-2070134712| ~z$r_buff1_thd0~0_In-2070134712)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2070134712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070134712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2070134712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070134712} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2070134712|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2070134712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070134712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2070134712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070134712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:58:44,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:58:44,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:58:44 BasicIcfg [2019-12-18 12:58:44,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:58:44,739 INFO L168 Benchmark]: Toolchain (without parser) took 125119.85 ms. Allocated memory was 144.7 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,739 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.47 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.5 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,741 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,741 INFO L168 Benchmark]: RCFGBuilder took 837.89 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 99.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,741 INFO L168 Benchmark]: TraceAbstraction took 123382.14 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:58:44,743 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.55 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.47 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 155.5 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.37 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.89 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 99.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123382.14 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t675, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t676, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t677, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9485 SDtfs, 10688 SDslu, 31881 SDs, 0 SdLazy, 17634 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 88 SyntacticMatches, 25 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 53.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 364260 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1729 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1627 ConstructedInterpolants, 0 QuantifiedInterpolants, 354835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...