/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/mix038_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:24:32,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:24:32,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:24:32,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:24:32,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:24:32,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:24:32,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:24:32,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:24:32,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:24:32,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:24:32,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:24:32,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:24:32,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:24:32,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:24:32,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:24:32,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:24:32,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:24:32,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:24:32,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:24:32,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:24:32,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:24:32,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:24:32,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:24:32,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:24:32,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:24:32,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:24:32,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:24:32,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:24:32,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:24:32,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:24:32,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:24:32,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:24:32,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:24:32,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:24:32,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:24:32,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:24:32,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:24:32,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:24:32,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:24:32,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:24:32,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:24:32,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:24:32,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:24:32,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:24:32,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:24:32,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:24:32,466 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:24:32,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:24:32,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:24:32,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:24:32,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:24:32,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:24:32,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:24:32,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:24:32,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:24:32,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:24:32,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:24:32,469 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:24:32,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:24:32,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:24:32,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:24:32,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:24:32,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:24:32,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:32,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:24:32,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:24:32,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:24:32,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:24:32,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:24:32,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:24:32,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:24:32,765 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:24:32,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2019-12-18 13:24:32,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c5f4cae/53b98b24791a4483b9a63384ba0ad47d/FLAG1e6cf2bc8 [2019-12-18 13:24:33,428 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:24:33,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2019-12-18 13:24:33,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c5f4cae/53b98b24791a4483b9a63384ba0ad47d/FLAG1e6cf2bc8 [2019-12-18 13:24:33,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c5f4cae/53b98b24791a4483b9a63384ba0ad47d [2019-12-18 13:24:33,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:24:33,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:24:33,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:33,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:24:33,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:24:33,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:33" (1/1) ... [2019-12-18 13:24:33,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:33, skipping insertion in model container [2019-12-18 13:24:33,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:24:33" (1/1) ... [2019-12-18 13:24:33,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:24:33,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:24:34,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:34,217 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:24:34,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:24:34,363 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:24:34,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34 WrapperNode [2019-12-18 13:24:34,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:24:34,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:34,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:24:34,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:24:34,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:24:34,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:24:34,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:24:34,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:24:34,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... [2019-12-18 13:24:34,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:24:34,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:24:34,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:24:34,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:24:34,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:24:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:24:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:24:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:24:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:24:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:24:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:24:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:24:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:24:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:24:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:24:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:24:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:24:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:24:34,542 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:24:35,325 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:24:35,326 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:24:35,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:35 BoogieIcfgContainer [2019-12-18 13:24:35,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:24:35,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:24:35,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:24:35,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:24:35,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:24:33" (1/3) ... [2019-12-18 13:24:35,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa69b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:35, skipping insertion in model container [2019-12-18 13:24:35,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:24:34" (2/3) ... [2019-12-18 13:24:35,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa69b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:24:35, skipping insertion in model container [2019-12-18 13:24:35,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:24:35" (3/3) ... [2019-12-18 13:24:35,337 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.oepc.i [2019-12-18 13:24:35,348 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:24:35,348 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:24:35,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:24:35,357 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:24:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,461 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,471 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,472 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,472 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:24:35,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:24:35,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:24:35,522 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:24:35,522 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:24:35,522 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:24:35,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:24:35,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:24:35,523 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:24:35,523 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:24:35,539 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:24:35,542 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:35,650 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:35,651 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:35,675 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:35,706 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:24:35,776 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:24:35,776 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:24:35,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:24:35,807 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:24:35,808 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:24:41,348 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:24:41,504 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:24:41,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 13:24:41,531 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:24:41,534 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:24:55,751 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 13:24:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 13:24:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:24:55,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:24:55,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:24:55,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:24:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:24:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 13:24:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:24:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613004794] [2019-12-18 13:24:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:24:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:24:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:24:56,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613004794] [2019-12-18 13:24:56,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:24:56,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:24:56,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400171645] [2019-12-18 13:24:56,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:24:56,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:24:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:24:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:24:56,112 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 13:25:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:00,089 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 13:25:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:00,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:25:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:00,731 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 13:25:00,732 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 13:25:00,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 13:25:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 13:25:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 13:25:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 13:25:08,144 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 13:25:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:08,145 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 13:25:08,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 13:25:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:25:08,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:08,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:08,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 13:25:08,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:08,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233507784] [2019-12-18 13:25:08,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:08,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233507784] [2019-12-18 13:25:08,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:08,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:08,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099142646] [2019-12-18 13:25:08,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:08,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:08,239 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 13:25:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:13,166 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 13:25:13,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:13,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:25:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:13,908 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 13:25:13,908 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 13:25:13,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 13:25:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 13:25:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 13:25:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 13:25:21,268 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 13:25:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:21,268 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 13:25:21,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 13:25:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:25:21,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:21,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:21,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 13:25:21,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:21,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354857097] [2019-12-18 13:25:21,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:21,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354857097] [2019-12-18 13:25:21,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:21,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:21,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345693127] [2019-12-18 13:25:21,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:21,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:21,333 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 13:25:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:25,646 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 13:25:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:25,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:25:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:25,697 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 13:25:25,697 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 13:25:25,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 13:25:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 13:25:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 13:25:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 13:25:26,247 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 13:25:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:26,248 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 13:25:26,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 13:25:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:25:26,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:26,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:26,252 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 13:25:26,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:26,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740581597] [2019-12-18 13:25:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:26,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740581597] [2019-12-18 13:25:26,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:26,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125024341] [2019-12-18 13:25:26,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:26,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:26,347 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 13:25:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:26,702 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 13:25:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:26,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:25:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:26,763 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 13:25:26,764 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 13:25:26,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 13:25:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 13:25:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 13:25:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 13:25:27,543 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 13:25:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:27,544 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 13:25:27,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 13:25:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:25:27,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:27,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:27,554 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 13:25:27,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:27,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130636437] [2019-12-18 13:25:27,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:27,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130636437] [2019-12-18 13:25:27,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:27,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:27,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864551138] [2019-12-18 13:25:27,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:27,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:27,683 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 13:25:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:28,523 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 13:25:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:28,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:25:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:28,605 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 13:25:28,605 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 13:25:28,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 13:25:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 13:25:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 13:25:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 13:25:29,226 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 13:25:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:29,227 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 13:25:29,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 13:25:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:25:29,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:29,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:29,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 13:25:29,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:29,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89537971] [2019-12-18 13:25:29,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:29,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89537971] [2019-12-18 13:25:29,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:29,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:29,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995808685] [2019-12-18 13:25:29,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:29,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:29,300 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 13:25:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:29,377 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 13:25:29,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:25:29,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:25:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:29,399 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 13:25:29,400 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 13:25:29,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 13:25:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 13:25:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 13:25:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 13:25:29,590 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 13:25:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:29,590 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 13:25:29,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:25:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 13:25:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:29,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:29,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:29,600 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 13:25:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:29,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540324494] [2019-12-18 13:25:29,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:29,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540324494] [2019-12-18 13:25:29,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:29,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:29,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241255793] [2019-12-18 13:25:29,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:29,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:29,653 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 13:25:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:29,749 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 13:25:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:29,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:29,783 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 13:25:29,783 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 13:25:29,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 13:25:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 13:25:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 13:25:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 13:25:30,013 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 13:25:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:30,013 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 13:25:30,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 13:25:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:30,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:30,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:30,032 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 13:25:30,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:30,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700848472] [2019-12-18 13:25:30,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:30,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700848472] [2019-12-18 13:25:30,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:30,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:25:30,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932114130] [2019-12-18 13:25:30,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:30,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:30,082 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 13:25:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:30,171 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 13:25:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:30,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:25:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:30,198 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 13:25:30,198 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 13:25:30,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 13:25:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 13:25:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 13:25:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 13:25:30,573 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 13:25:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:30,573 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 13:25:30,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 13:25:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:25:30,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:30,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:30,585 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 13:25:30,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:30,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050880754] [2019-12-18 13:25:30,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:30,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050880754] [2019-12-18 13:25:30,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:30,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:30,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799930379] [2019-12-18 13:25:30,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:30,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:30,681 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 13:25:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:31,280 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 13:25:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:31,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:25:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:31,327 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 13:25:31,327 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 13:25:31,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 13:25:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 13:25:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 13:25:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 13:25:31,688 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 13:25:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:31,688 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 13:25:31,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 13:25:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:25:31,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:31,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:31,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 13:25:31,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:31,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971419203] [2019-12-18 13:25:31,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:31,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971419203] [2019-12-18 13:25:31,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:31,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:31,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926280763] [2019-12-18 13:25:31,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:25:31,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:25:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:25:31,812 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 13:25:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:32,386 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 13:25:32,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:25:32,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:25:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:32,426 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 13:25:32,427 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 13:25:32,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 13:25:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 13:25:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 13:25:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 13:25:32,751 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 13:25:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:32,751 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 13:25:32,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:25:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 13:25:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:32,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:32,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:32,771 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:32,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 13:25:32,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:32,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979788763] [2019-12-18 13:25:32,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:32,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979788763] [2019-12-18 13:25:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:32,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836980924] [2019-12-18 13:25:32,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:32,864 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 13:25:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:34,059 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 13:25:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:34,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:25:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:34,114 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 13:25:34,114 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 13:25:34,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 13:25:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 13:25:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 13:25:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 13:25:34,673 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 13:25:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:34,673 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 13:25:34,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 13:25:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:25:34,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:34,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:34,693 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 13:25:34,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:34,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489019740] [2019-12-18 13:25:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:34,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489019740] [2019-12-18 13:25:34,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:34,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:34,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38247036] [2019-12-18 13:25:34,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:34,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:34,805 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 13:25:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:36,491 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 13:25:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:36,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:25:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:36,555 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 13:25:36,555 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 13:25:36,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 13:25:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 13:25:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 13:25:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 13:25:37,021 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 13:25:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:37,021 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 13:25:37,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 13:25:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:37,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:37,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:37,039 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 13:25:37,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:37,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422974706] [2019-12-18 13:25:37,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:37,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422974706] [2019-12-18 13:25:37,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:37,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:37,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542893413] [2019-12-18 13:25:37,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:37,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:37,155 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 13:25:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:38,470 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 13:25:38,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:38,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:25:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:38,520 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 13:25:38,520 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 13:25:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 13:25:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 13:25:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 13:25:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 13:25:39,134 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 13:25:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:39,134 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 13:25:39,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 13:25:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:39,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:39,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:39,151 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 13:25:39,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112723270] [2019-12-18 13:25:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:39,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 13:25:39,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112723270] [2019-12-18 13:25:39,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:39,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:39,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866129645] [2019-12-18 13:25:39,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:39,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:39,247 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-18 13:25:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:40,440 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 13:25:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:25:40,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:25:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:40,498 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 13:25:40,498 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 13:25:40,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:25:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 13:25:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 13:25:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 13:25:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 13:25:40,898 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 13:25:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:40,898 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 13:25:40,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 13:25:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:25:40,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:40,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:40,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 13:25:40,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:40,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654595370] [2019-12-18 13:25:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:41,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654595370] [2019-12-18 13:25:41,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:41,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:41,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52506781] [2019-12-18 13:25:41,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:41,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:41,024 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-18 13:25:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:42,621 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-18 13:25:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:25:42,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 13:25:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:42,675 INFO L225 Difference]: With dead ends: 39307 [2019-12-18 13:25:42,675 INFO L226 Difference]: Without dead ends: 39307 [2019-12-18 13:25:42,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-18 13:25:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-18 13:25:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 13:25:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-18 13:25:43,050 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-18 13:25:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:43,051 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-18 13:25:43,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-18 13:25:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:25:43,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:43,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:43,071 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 13:25:43,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:43,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068880758] [2019-12-18 13:25:43,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:43,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068880758] [2019-12-18 13:25:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:43,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:25:43,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851830999] [2019-12-18 13:25:43,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:43,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:43,135 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-18 13:25:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:43,196 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-18 13:25:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:43,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:25:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:43,224 INFO L225 Difference]: With dead ends: 16672 [2019-12-18 13:25:43,224 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 13:25:43,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 13:25:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 13:25:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 13:25:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-18 13:25:43,679 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-18 13:25:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:43,679 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-18 13:25:43,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-18 13:25:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:25:43,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:43,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:43,700 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:43,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:43,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 13:25:43,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:43,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412395447] [2019-12-18 13:25:43,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:43,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412395447] [2019-12-18 13:25:43,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:43,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:25:43,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232061683] [2019-12-18 13:25:43,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:43,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:43,809 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-18 13:25:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,406 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-18 13:25:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:25:44,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:25:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:44,445 INFO L225 Difference]: With dead ends: 27362 [2019-12-18 13:25:44,445 INFO L226 Difference]: Without dead ends: 27362 [2019-12-18 13:25:44,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-18 13:25:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-18 13:25:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-18 13:25:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-18 13:25:44,790 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-18 13:25:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:44,790 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-18 13:25:44,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-18 13:25:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:25:44,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:44,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:44,813 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-18 13:25:44,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:44,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268631694] [2019-12-18 13:25:44,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:44,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268631694] [2019-12-18 13:25:44,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:44,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:25:44,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174840940] [2019-12-18 13:25:44,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:25:44,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:25:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:44,867 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-18 13:25:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:44,965 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-18 13:25:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:25:44,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:25:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:45,008 INFO L225 Difference]: With dead ends: 20430 [2019-12-18 13:25:45,008 INFO L226 Difference]: Without dead ends: 20430 [2019-12-18 13:25:45,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:25:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-18 13:25:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-18 13:25:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-18 13:25:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-18 13:25:45,438 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-18 13:25:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:45,438 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-18 13:25:45,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:25:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-18 13:25:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:45,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:45,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:45,467 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-18 13:25:45,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:45,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862745260] [2019-12-18 13:25:45,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862745260] [2019-12-18 13:25:45,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:25:45,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673188186] [2019-12-18 13:25:45,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:45,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:45,580 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-18 13:25:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:46,880 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-18 13:25:46,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:25:46,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 13:25:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:46,973 INFO L225 Difference]: With dead ends: 91773 [2019-12-18 13:25:46,974 INFO L226 Difference]: Without dead ends: 65597 [2019-12-18 13:25:46,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:25:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-18 13:25:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-18 13:25:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-18 13:25:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-18 13:25:47,951 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-18 13:25:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-18 13:25:47,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:25:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-18 13:25:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:47,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:47,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, 1] [2019-12-18 13:25:47,981 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-18 13:25:47,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:47,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120694001] [2019-12-18 13:25:47,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:48,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120694001] [2019-12-18 13:25:48,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:48,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:48,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249617637] [2019-12-18 13:25:48,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:48,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:48,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:48,068 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-18 13:25:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:48,629 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-18 13:25:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:25:48,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:25:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:48,699 INFO L225 Difference]: With dead ends: 62216 [2019-12-18 13:25:48,699 INFO L226 Difference]: Without dead ends: 45804 [2019-12-18 13:25:48,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:25:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-18 13:25:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-18 13:25:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-18 13:25:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-18 13:25:49,237 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-18 13:25:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:49,238 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-18 13:25:49,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-18 13:25:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:49,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:49,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:49,268 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-18 13:25:49,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:49,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24339487] [2019-12-18 13:25:49,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:49,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24339487] [2019-12-18 13:25:49,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:49,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:49,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563031094] [2019-12-18 13:25:49,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:25:49,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:25:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:49,403 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-18 13:25:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:50,857 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-18 13:25:50,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:25:50,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:25:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:51,019 INFO L225 Difference]: With dead ends: 113274 [2019-12-18 13:25:51,019 INFO L226 Difference]: Without dead ends: 108630 [2019-12-18 13:25:51,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:25:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-18 13:25:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-18 13:25:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-18 13:25:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-18 13:25:52,389 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-18 13:25:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:52,390 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-18 13:25:52,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:25:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-18 13:25:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:52,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:52,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:52,423 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-18 13:25:52,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:52,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218508326] [2019-12-18 13:25:52,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:52,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218508326] [2019-12-18 13:25:52,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:52,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:52,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695887986] [2019-12-18 13:25:52,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:25:52,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:52,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:25:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:25:52,548 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-18 13:25:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:54,216 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-18 13:25:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:25:54,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:25:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:54,392 INFO L225 Difference]: With dead ends: 91424 [2019-12-18 13:25:54,392 INFO L226 Difference]: Without dead ends: 87972 [2019-12-18 13:25:54,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:25:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-18 13:25:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-18 13:25:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-18 13:25:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-18 13:25:55,328 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-18 13:25:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:55,328 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-18 13:25:55,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:25:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-18 13:25:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:55,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:55,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:55,358 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-18 13:25:55,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:55,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331173506] [2019-12-18 13:25:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:55,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331173506] [2019-12-18 13:25:55,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:55,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:25:55,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036640102] [2019-12-18 13:25:55,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:55,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:55,433 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-18 13:25:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:55,884 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-18 13:25:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:25:55,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:25:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:55,963 INFO L225 Difference]: With dead ends: 58989 [2019-12-18 13:25:55,963 INFO L226 Difference]: Without dead ends: 49515 [2019-12-18 13:25:55,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:25:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-18 13:25:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-18 13:25:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-18 13:25:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-18 13:25:56,738 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-18 13:25:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:56,738 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-18 13:25:56,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-18 13:25:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:56,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:56,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:56,769 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-18 13:25:56,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:56,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081409] [2019-12-18 13:25:56,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:56,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081409] [2019-12-18 13:25:56,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:56,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:25:56,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906512248] [2019-12-18 13:25:56,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:25:56,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:25:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:25:56,879 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-18 13:25:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:58,355 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-18 13:25:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:25:58,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:25:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:58,433 INFO L225 Difference]: With dead ends: 52488 [2019-12-18 13:25:58,433 INFO L226 Difference]: Without dead ends: 52488 [2019-12-18 13:25:58,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:25:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-18 13:25:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-18 13:25:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 13:25:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-18 13:25:59,033 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-18 13:25:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:59,033 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-18 13:25:59,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:25:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-18 13:25:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:25:59,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:59,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:59,064 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-18 13:25:59,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:59,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896913615] [2019-12-18 13:25:59,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:25:59,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896913615] [2019-12-18 13:25:59,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:59,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:25:59,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586232068] [2019-12-18 13:25:59,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:25:59,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:25:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:25:59,200 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-18 13:26:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:00,902 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-18 13:26:00,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:26:00,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 13:26:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:00,985 INFO L225 Difference]: With dead ends: 56163 [2019-12-18 13:26:00,985 INFO L226 Difference]: Without dead ends: 56163 [2019-12-18 13:26:00,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:26:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-18 13:26:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-18 13:26:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-18 13:26:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-18 13:26:01,855 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-18 13:26:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:01,855 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-18 13:26:01,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-18 13:26:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:26:01,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:01,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:01,885 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-18 13:26:01,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:01,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738516356] [2019-12-18 13:26:01,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:01,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738516356] [2019-12-18 13:26:01,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:01,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:01,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279477553] [2019-12-18 13:26:01,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:01,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:01,941 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-18 13:26:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:02,102 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-18 13:26:02,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:02,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:26:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:02,163 INFO L225 Difference]: With dead ends: 32830 [2019-12-18 13:26:02,163 INFO L226 Difference]: Without dead ends: 32830 [2019-12-18 13:26:02,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-18 13:26:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-18 13:26:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-18 13:26:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-18 13:26:02,763 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-18 13:26:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:02,764 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-18 13:26:02,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-18 13:26:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:02,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:02,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:02,795 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-18 13:26:02,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:02,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949071625] [2019-12-18 13:26:02,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:02,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949071625] [2019-12-18 13:26:02,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:02,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451843562] [2019-12-18 13:26:02,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:02,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:02,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:02,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:02,842 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-18 13:26:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:03,114 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-18 13:26:03,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:03,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:03,164 INFO L225 Difference]: With dead ends: 36066 [2019-12-18 13:26:03,165 INFO L226 Difference]: Without dead ends: 36066 [2019-12-18 13:26:03,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-18 13:26:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-18 13:26:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-18 13:26:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-18 13:26:03,620 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-18 13:26:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:03,620 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-18 13:26:03,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-18 13:26:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:03,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:03,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:03,653 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-18 13:26:03,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:03,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865704424] [2019-12-18 13:26:03,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:03,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865704424] [2019-12-18 13:26:03,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:03,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:03,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101710822] [2019-12-18 13:26:03,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:03,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:03,734 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-18 13:26:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:04,696 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-18 13:26:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:26:04,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:26:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:04,805 INFO L225 Difference]: With dead ends: 80928 [2019-12-18 13:26:04,805 INFO L226 Difference]: Without dead ends: 74194 [2019-12-18 13:26:04,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:26:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-18 13:26:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-18 13:26:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-18 13:26:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-18 13:26:05,849 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-18 13:26:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:05,849 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-18 13:26:05,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-18 13:26:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:05,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:05,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:05,881 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:05,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-18 13:26:05,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:05,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601384983] [2019-12-18 13:26:05,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:05,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601384983] [2019-12-18 13:26:05,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:05,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:05,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427481570] [2019-12-18 13:26:05,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:05,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:05,937 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-18 13:26:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:06,261 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-18 13:26:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:26:06,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:06,336 INFO L225 Difference]: With dead ends: 45778 [2019-12-18 13:26:06,336 INFO L226 Difference]: Without dead ends: 45778 [2019-12-18 13:26:06,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-18 13:26:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-18 13:26:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-18 13:26:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-18 13:26:06,927 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-18 13:26:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:06,927 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-18 13:26:06,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-18 13:26:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:06,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:06,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:06,966 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 13:26:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:06,966 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-18 13:26:06,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:06,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132805747] [2019-12-18 13:26:06,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:07,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132805747] [2019-12-18 13:26:07,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:07,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:07,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431529119] [2019-12-18 13:26:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:07,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:07,095 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-18 13:26:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:08,878 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-18 13:26:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:26:08,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:26:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:09,013 INFO L225 Difference]: With dead ends: 103839 [2019-12-18 13:26:09,013 INFO L226 Difference]: Without dead ends: 93795 [2019-12-18 13:26:09,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:26:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-18 13:26:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-18 13:26:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-18 13:26:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-18 13:26:10,323 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-18 13:26:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:10,324 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-18 13:26:10,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-18 13:26:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:10,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:10,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:10,359 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 13:26:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-18 13:26:10,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:10,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762830065] [2019-12-18 13:26:10,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:10,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762830065] [2019-12-18 13:26:10,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:10,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:10,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386712282] [2019-12-18 13:26:10,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:26:10,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:26:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:26:10,471 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-18 13:26:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:11,668 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-18 13:26:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:26:11,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:26:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:11,790 INFO L225 Difference]: With dead ends: 88943 [2019-12-18 13:26:11,790 INFO L226 Difference]: Without dead ends: 84511 [2019-12-18 13:26:11,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:26:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-18 13:26:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-18 13:26:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-18 13:26:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-18 13:26:12,675 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-18 13:26:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:12,675 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-18 13:26:12,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:26:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-18 13:26:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:12,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:12,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:12,708 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 13:26:12,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:12,708 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-18 13:26:12,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:12,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284162926] [2019-12-18 13:26:12,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:12,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284162926] [2019-12-18 13:26:12,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:12,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:26:12,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308304567] [2019-12-18 13:26:12,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:12,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:12,829 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-18 13:26:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:14,300 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-18 13:26:14,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:26:14,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:26:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:14,371 INFO L225 Difference]: With dead ends: 50821 [2019-12-18 13:26:14,371 INFO L226 Difference]: Without dead ends: 50821 [2019-12-18 13:26:14,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:26:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-18 13:26:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-18 13:26:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-18 13:26:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-18 13:26:15,238 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-18 13:26:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:15,238 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-18 13:26:15,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-18 13:26:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:15,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:15,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:15,273 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 13:26:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-18 13:26:15,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:15,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739199408] [2019-12-18 13:26:15,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:15,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739199408] [2019-12-18 13:26:15,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:15,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:26:15,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427108684] [2019-12-18 13:26:15,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:26:15,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:26:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:15,347 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-18 13:26:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:15,911 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-18 13:26:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:26:15,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 13:26:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:15,970 INFO L225 Difference]: With dead ends: 41644 [2019-12-18 13:26:15,970 INFO L226 Difference]: Without dead ends: 41400 [2019-12-18 13:26:15,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:26:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-18 13:26:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-18 13:26:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-18 13:26:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-18 13:26:16,528 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-18 13:26:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:16,529 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-18 13:26:16,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:26:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-18 13:26:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:16,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:16,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:16,569 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 13:26:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-18 13:26:16,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:16,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73542599] [2019-12-18 13:26:16,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:16,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73542599] [2019-12-18 13:26:16,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:16,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:26:16,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925751564] [2019-12-18 13:26:16,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:16,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:16,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:16,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:16,634 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-18 13:26:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:16,814 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-18 13:26:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:16,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:26:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:16,861 INFO L225 Difference]: With dead ends: 36756 [2019-12-18 13:26:16,862 INFO L226 Difference]: Without dead ends: 36756 [2019-12-18 13:26:16,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-18 13:26:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-18 13:26:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-18 13:26:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-18 13:26:17,379 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-18 13:26:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:17,379 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-18 13:26:17,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-18 13:26:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:17,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:17,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:17,418 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 13:26:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-18 13:26:17,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:17,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441839048] [2019-12-18 13:26:17,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441839048] [2019-12-18 13:26:17,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:17,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:17,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772413586] [2019-12-18 13:26:17,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:17,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:17,533 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 8 states. [2019-12-18 13:26:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:19,820 INFO L93 Difference]: Finished difference Result 61177 states and 181302 transitions. [2019-12-18 13:26:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:26:19,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:26:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:19,895 INFO L225 Difference]: With dead ends: 61177 [2019-12-18 13:26:19,895 INFO L226 Difference]: Without dead ends: 61177 [2019-12-18 13:26:19,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:26:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61177 states. [2019-12-18 13:26:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61177 to 32322. [2019-12-18 13:26:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32322 states. [2019-12-18 13:26:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32322 states to 32322 states and 96920 transitions. [2019-12-18 13:26:20,579 INFO L78 Accepts]: Start accepts. Automaton has 32322 states and 96920 transitions. Word has length 65 [2019-12-18 13:26:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:20,580 INFO L462 AbstractCegarLoop]: Abstraction has 32322 states and 96920 transitions. [2019-12-18 13:26:20,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32322 states and 96920 transitions. [2019-12-18 13:26:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:20,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:20,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:20,616 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 13:26:20,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-18 13:26:20,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:20,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47840676] [2019-12-18 13:26:20,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:20,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47840676] [2019-12-18 13:26:20,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:20,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:26:20,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064697177] [2019-12-18 13:26:20,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:26:20,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:26:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:26:20,737 INFO L87 Difference]: Start difference. First operand 32322 states and 96920 transitions. Second operand 8 states. [2019-12-18 13:26:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:22,835 INFO L93 Difference]: Finished difference Result 61393 states and 181612 transitions. [2019-12-18 13:26:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:26:22,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:26:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:22,926 INFO L225 Difference]: With dead ends: 61393 [2019-12-18 13:26:22,926 INFO L226 Difference]: Without dead ends: 61141 [2019-12-18 13:26:22,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:26:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61141 states. [2019-12-18 13:26:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61141 to 34978. [2019-12-18 13:26:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34978 states. [2019-12-18 13:26:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34978 states to 34978 states and 104631 transitions. [2019-12-18 13:26:23,680 INFO L78 Accepts]: Start accepts. Automaton has 34978 states and 104631 transitions. Word has length 65 [2019-12-18 13:26:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:23,680 INFO L462 AbstractCegarLoop]: Abstraction has 34978 states and 104631 transitions. [2019-12-18 13:26:23,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:26:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34978 states and 104631 transitions. [2019-12-18 13:26:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:23,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:23,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:23,719 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 13:26:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 4 times [2019-12-18 13:26:23,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:23,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512305021] [2019-12-18 13:26:23,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:23,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512305021] [2019-12-18 13:26:23,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:23,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:26:23,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616796155] [2019-12-18 13:26:23,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:26:23,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:26:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:26:23,861 INFO L87 Difference]: Start difference. First operand 34978 states and 104631 transitions. Second operand 10 states. [2019-12-18 13:26:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:27,183 INFO L93 Difference]: Finished difference Result 62457 states and 184588 transitions. [2019-12-18 13:26:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 13:26:27,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 13:26:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:27,269 INFO L225 Difference]: With dead ends: 62457 [2019-12-18 13:26:27,269 INFO L226 Difference]: Without dead ends: 62457 [2019-12-18 13:26:27,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 13:26:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62457 states. [2019-12-18 13:26:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62457 to 36271. [2019-12-18 13:26:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36271 states. [2019-12-18 13:26:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36271 states to 36271 states and 108406 transitions. [2019-12-18 13:26:28,026 INFO L78 Accepts]: Start accepts. Automaton has 36271 states and 108406 transitions. Word has length 65 [2019-12-18 13:26:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:28,026 INFO L462 AbstractCegarLoop]: Abstraction has 36271 states and 108406 transitions. [2019-12-18 13:26:28,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:26:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 36271 states and 108406 transitions. [2019-12-18 13:26:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:26:28,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:28,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:28,067 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1095461897, now seen corresponding path program 5 times [2019-12-18 13:26:28,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:28,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687235350] [2019-12-18 13:26:28,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:28,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687235350] [2019-12-18 13:26:28,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5788185] [2019-12-18 13:26:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:28,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:28,132 INFO L87 Difference]: Start difference. First operand 36271 states and 108406 transitions. Second operand 3 states. [2019-12-18 13:26:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:28,239 INFO L93 Difference]: Finished difference Result 36271 states and 108405 transitions. [2019-12-18 13:26:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:28,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:26:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:28,290 INFO L225 Difference]: With dead ends: 36271 [2019-12-18 13:26:28,290 INFO L226 Difference]: Without dead ends: 36271 [2019-12-18 13:26:28,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36271 states. [2019-12-18 13:26:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36271 to 25447. [2019-12-18 13:26:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25447 states. [2019-12-18 13:26:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25447 states to 25447 states and 78113 transitions. [2019-12-18 13:26:28,742 INFO L78 Accepts]: Start accepts. Automaton has 25447 states and 78113 transitions. Word has length 65 [2019-12-18 13:26:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:28,742 INFO L462 AbstractCegarLoop]: Abstraction has 25447 states and 78113 transitions. [2019-12-18 13:26:28,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25447 states and 78113 transitions. [2019-12-18 13:26:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:26:28,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:28,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:28,770 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-18 13:26:28,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:28,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022192364] [2019-12-18 13:26:28,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:26:28,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022192364] [2019-12-18 13:26:28,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:28,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707576633] [2019-12-18 13:26:28,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:26:28,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:28,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:26:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:28,829 INFO L87 Difference]: Start difference. First operand 25447 states and 78113 transitions. Second operand 3 states. [2019-12-18 13:26:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:28,911 INFO L93 Difference]: Finished difference Result 20509 states and 61824 transitions. [2019-12-18 13:26:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:26:28,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:26:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:28,937 INFO L225 Difference]: With dead ends: 20509 [2019-12-18 13:26:28,938 INFO L226 Difference]: Without dead ends: 20509 [2019-12-18 13:26:28,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:26:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20509 states. [2019-12-18 13:26:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20509 to 18509. [2019-12-18 13:26:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18509 states. [2019-12-18 13:26:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 55754 transitions. [2019-12-18 13:26:29,197 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 55754 transitions. Word has length 66 [2019-12-18 13:26:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:29,198 INFO L462 AbstractCegarLoop]: Abstraction has 18509 states and 55754 transitions. [2019-12-18 13:26:29,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:26:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 55754 transitions. [2019-12-18 13:26:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:26:29,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:29,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:29,215 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 13:26:29,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:29,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677241388] [2019-12-18 13:26:29,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:26:29,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:26:29,394 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:26:29,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1007~0.base_51|)) (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1007~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1007~0.base_51|) |v_ULTIMATE.start_main_~#t1007~0.offset_32| 0)) |v_#memory_int_21|) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1007~0.base_51|) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t1007~0.offset_32| 0) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store .cse0 |v_ULTIMATE.start_main_~#t1007~0.base_51| 1) |v_#valid_87|) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1007~0.base_51| 4)) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ULTIMATE.start_main_~#t1008~0.offset=|v_ULTIMATE.start_main_~#t1008~0.offset_19|, ULTIMATE.start_main_~#t1008~0.base=|v_ULTIMATE.start_main_~#t1008~0.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ULTIMATE.start_main_~#t1007~0.offset=|v_ULTIMATE.start_main_~#t1007~0.offset_32|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ULTIMATE.start_main_~#t1009~0.base=|v_ULTIMATE.start_main_~#t1009~0.base_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_~#t1009~0.offset=|v_ULTIMATE.start_main_~#t1009~0.offset_20|, ULTIMATE.start_main_~#t1007~0.base=|v_ULTIMATE.start_main_~#t1007~0.base_51|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1008~0.offset, ULTIMATE.start_main_~#t1008~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1007~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t1009~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1009~0.offset, ULTIMATE.start_main_~#t1007~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:26:29,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff0_thd0~0_In1262420163 ~a$r_buff1_thd0~0_Out1262420163) (= 1 ~x~0_Out1262420163) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1262420163 0)) (= ~a$r_buff0_thd2~0_In1262420163 ~a$r_buff1_thd2~0_Out1262420163) (= 1 ~a$r_buff0_thd1~0_Out1262420163) (= ~a$r_buff1_thd3~0_Out1262420163 ~a$r_buff0_thd3~0_In1262420163) (= ~a$r_buff0_thd1~0_In1262420163 ~a$r_buff1_thd1~0_Out1262420163)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1262420163, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1262420163, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1262420163, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1262420163, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1262420163} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1262420163, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1262420163, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1262420163, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1262420163, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1262420163, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1262420163, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1262420163, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1262420163, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1262420163, ~x~0=~x~0_Out1262420163} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:26:29,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1008~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1008~0.offset_7| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1008~0.base_9|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1008~0.base_9|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1008~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1008~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1008~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1008~0.base_9|) |v_ULTIMATE.start_main_~#t1008~0.offset_7| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1008~0.offset=|v_ULTIMATE.start_main_~#t1008~0.offset_7|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1008~0.base=|v_ULTIMATE.start_main_~#t1008~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1008~0.offset, ULTIMATE.start_main_~#t1008~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:26:29,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1009~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1009~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1009~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1009~0.base_9| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1009~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1009~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1009~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1009~0.base_9|) |v_ULTIMATE.start_main_~#t1009~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1009~0.offset=|v_ULTIMATE.start_main_~#t1009~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1009~0.base=|v_ULTIMATE.start_main_~#t1009~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1009~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1009~0.base, #length] because there is no mapped edge [2019-12-18 13:26:29,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1089387926| |P1Thread1of1ForFork2_#t~ite10_Out1089387926|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1089387926 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1089387926 256)))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1089387926| ~a$w_buff1~0_In1089387926) (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1089387926| ~a~0_In1089387926) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In1089387926, ~a$w_buff1~0=~a$w_buff1~0_In1089387926, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1089387926, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1089387926} OutVars{~a~0=~a~0_In1089387926, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1089387926|, ~a$w_buff1~0=~a$w_buff1~0_In1089387926, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1089387926, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1089387926|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1089387926} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:26:29,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In534980829 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In534980829 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out534980829|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In534980829 |P1Thread1of1ForFork2_#t~ite11_Out534980829|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In534980829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In534980829} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In534980829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In534980829, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out534980829|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:26:29,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In546151555 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In546151555 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In546151555 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In546151555 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out546151555|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In546151555 |P1Thread1of1ForFork2_#t~ite12_Out546151555|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In546151555, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In546151555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In546151555, ~a$w_buff1_used~0=~a$w_buff1_used~0_In546151555} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In546151555, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In546151555, ~a$w_buff0_used~0=~a$w_buff0_used~0_In546151555, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out546151555|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In546151555} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:26:29,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In822125330 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In822125330| |P2Thread1of1ForFork0_#t~ite20_Out822125330|) (= |P2Thread1of1ForFork0_#t~ite21_Out822125330| ~a$w_buff0~0_In822125330) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out822125330| ~a$w_buff0~0_In822125330) (= |P2Thread1of1ForFork0_#t~ite21_Out822125330| |P2Thread1of1ForFork0_#t~ite20_Out822125330|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In822125330 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In822125330 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In822125330 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In822125330 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In822125330, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In822125330, ~a$w_buff0_used~0=~a$w_buff0_used~0_In822125330, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In822125330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In822125330, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In822125330|, ~weak$$choice2~0=~weak$$choice2~0_In822125330} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out822125330|, ~a$w_buff0~0=~a$w_buff0~0_In822125330, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In822125330, ~a$w_buff0_used~0=~a$w_buff0_used~0_In822125330, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In822125330, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out822125330|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In822125330, ~weak$$choice2~0=~weak$$choice2~0_In822125330} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 13:26:29,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-335633815 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-335633815 256)))) (or (and (= ~a$r_buff0_thd2~0_In-335633815 |P1Thread1of1ForFork2_#t~ite13_Out-335633815|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-335633815|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-335633815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-335633815} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-335633815, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-335633815, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-335633815|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:26:29,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In-1020714341 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1020714341 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1020714341 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1020714341 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1020714341|)) (and (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-1020714341 |P1Thread1of1ForFork2_#t~ite14_Out-1020714341|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1020714341, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1020714341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1020714341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1020714341} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1020714341, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1020714341, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1020714341, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1020714341, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1020714341|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:26:29,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:26:29,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-161715332 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-161715332 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-161715332 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-161715332 256) 0) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-161715332 256))))) (= |P2Thread1of1ForFork0_#t~ite24_Out-161715332| |P2Thread1of1ForFork0_#t~ite23_Out-161715332|) (= |P2Thread1of1ForFork0_#t~ite23_Out-161715332| ~a$w_buff1~0_In-161715332) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In-161715332| |P2Thread1of1ForFork0_#t~ite23_Out-161715332|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite24_Out-161715332| ~a$w_buff1~0_In-161715332)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-161715332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-161715332|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-161715332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-161715332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-161715332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-161715332, ~weak$$choice2~0=~weak$$choice2~0_In-161715332} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-161715332, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-161715332|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-161715332|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-161715332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-161715332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-161715332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-161715332, ~weak$$choice2~0=~weak$$choice2~0_In-161715332} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 13:26:29,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1659033116 256)))) (or (and (= ~a$w_buff0_used~0_In-1659033116 |P2Thread1of1ForFork0_#t~ite26_Out-1659033116|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1659033116 256)))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1659033116 256))) (= 0 (mod ~a$w_buff0_used~0_In-1659033116 256)) (and (= (mod ~a$w_buff1_used~0_In-1659033116 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1659033116| |P2Thread1of1ForFork0_#t~ite26_Out-1659033116|)) (and (= ~a$w_buff0_used~0_In-1659033116 |P2Thread1of1ForFork0_#t~ite27_Out-1659033116|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-1659033116| |P2Thread1of1ForFork0_#t~ite26_Out-1659033116|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1659033116|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1659033116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659033116, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1659033116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659033116, ~weak$$choice2~0=~weak$$choice2~0_In-1659033116} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1659033116|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1659033116|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1659033116, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1659033116, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1659033116, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1659033116, ~weak$$choice2~0=~weak$$choice2~0_In-1659033116} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:26:29,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:26:29,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:26:29,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In79685399 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In79685399 256) 0))) (or (and (= ~a~0_In79685399 |P2Thread1of1ForFork0_#t~ite38_Out79685399|) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In79685399 |P2Thread1of1ForFork0_#t~ite38_Out79685399|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In79685399, ~a$w_buff1~0=~a$w_buff1~0_In79685399, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In79685399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In79685399} OutVars{~a~0=~a~0_In79685399, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out79685399|, ~a$w_buff1~0=~a$w_buff1~0_In79685399, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In79685399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In79685399} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:26:29,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:26:29,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1216714305 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1216714305 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1216714305|)) (and (= ~a$w_buff0_used~0_In1216714305 |P2Thread1of1ForFork0_#t~ite40_Out1216714305|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1216714305, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1216714305} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1216714305|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216714305, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1216714305} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:26:29,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1390797360 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1390797360 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1390797360| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1390797360 |P0Thread1of1ForFork1_#t~ite5_Out1390797360|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1390797360, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1390797360} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1390797360|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1390797360, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1390797360} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:26:29,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1537003674 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1537003674 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In1537003674 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1537003674 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1537003674|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1537003674 |P0Thread1of1ForFork1_#t~ite6_Out1537003674|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1537003674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1537003674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1537003674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1537003674} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1537003674|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1537003674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1537003674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1537003674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1537003674} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:26:29,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2112792561 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-2112792561 256)))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-2112792561 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out-2112792561 ~a$r_buff0_thd1~0_In-2112792561)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2112792561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2112792561} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2112792561|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2112792561, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2112792561} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:26:29,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1242228913 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1242228913 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1242228913 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1242228913 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1242228913| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out1242228913| ~a$r_buff1_thd1~0_In1242228913)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1242228913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242228913, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1242228913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1242228913} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1242228913|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1242228913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242228913, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1242228913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1242228913} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:26:29,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:26:29,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1958266497 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1958266497 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-1958266497 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1958266497 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1958266497| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-1958266497| ~a$w_buff1_used~0_In-1958266497) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1958266497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1958266497, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1958266497, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1958266497} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1958266497, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1958266497, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1958266497, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1958266497, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1958266497|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:26:29,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-506836052 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-506836052 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-506836052| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-506836052| ~a$r_buff0_thd3~0_In-506836052) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-506836052, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-506836052} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-506836052, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-506836052, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-506836052|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:26:29,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In299478729 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In299478729 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In299478729 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In299478729 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out299478729| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out299478729| ~a$r_buff1_thd3~0_In299478729) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In299478729, ~a$w_buff0_used~0=~a$w_buff0_used~0_In299478729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In299478729, ~a$w_buff1_used~0=~a$w_buff1_used~0_In299478729} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out299478729|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In299478729, ~a$w_buff0_used~0=~a$w_buff0_used~0_In299478729, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In299478729, ~a$w_buff1_used~0=~a$w_buff1_used~0_In299478729} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:26:29,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:26:29,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:26:29,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1844954375 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out1844954375| |ULTIMATE.start_main_#t~ite47_Out1844954375|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1844954375 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In1844954375 |ULTIMATE.start_main_#t~ite47_Out1844954375|)) (and (not .cse1) .cse2 (= ~a$w_buff1~0_In1844954375 |ULTIMATE.start_main_#t~ite47_Out1844954375|) (not .cse0)))) InVars {~a~0=~a~0_In1844954375, ~a$w_buff1~0=~a$w_buff1~0_In1844954375, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1844954375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1844954375} OutVars{~a~0=~a~0_In1844954375, ~a$w_buff1~0=~a$w_buff1~0_In1844954375, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1844954375|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1844954375, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1844954375|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1844954375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:26:29,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In2023017474 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2023017474 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out2023017474|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In2023017474 |ULTIMATE.start_main_#t~ite49_Out2023017474|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2023017474, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2023017474} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2023017474, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2023017474|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2023017474} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:26:29,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1082003940 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1082003940 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1082003940 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1082003940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1082003940| 0)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1082003940 |ULTIMATE.start_main_#t~ite50_Out-1082003940|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1082003940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1082003940, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1082003940, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1082003940} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1082003940|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1082003940, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1082003940, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1082003940, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1082003940} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:26:29,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1698691646 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1698691646 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-1698691646| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1698691646 |ULTIMATE.start_main_#t~ite51_Out-1698691646|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698691646, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1698691646} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1698691646|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698691646, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1698691646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:26:29,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1830492418 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1830492418 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1830492418 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1830492418 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In1830492418 |ULTIMATE.start_main_#t~ite52_Out1830492418|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1830492418|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1830492418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1830492418, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1830492418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1830492418} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1830492418|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1830492418, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1830492418, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1830492418, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1830492418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:26:29,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:26:29,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:26:29 BasicIcfg [2019-12-18 13:26:29,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:26:29,550 INFO L168 Benchmark]: Toolchain (without parser) took 115881.40 ms. Allocated memory was 146.3 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,550 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.63 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.16 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.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 13:26:29,551 INFO L168 Benchmark]: Boogie Preprocessor took 40.15 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,552 INFO L168 Benchmark]: RCFGBuilder took 862.60 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,552 INFO L168 Benchmark]: TraceAbstraction took 114219.69 ms. Allocated memory was 203.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 13:26:29,554 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.47 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.63 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.16 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.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.15 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 862.60 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114219.69 ms. Allocated memory was 203.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1007, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1008, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1009, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.8s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10174 SDtfs, 14940 SDslu, 29080 SDs, 0 SdLazy, 20018 SolverSat, 898 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 164 SyntacticMatches, 26 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 758260 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1911 NumberOfCodeBlocks, 1911 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 338457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...