/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:24:01,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:24:01,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:24:01,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:24:01,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:24:01,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:24:01,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:24:01,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:24:01,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:24:01,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:24:01,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:24:01,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:24:01,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:24:01,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:24:01,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:24:01,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:24:01,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:24:01,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:24:01,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:24:01,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:24:01,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:24:01,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:24:01,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:24:01,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:24:01,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:24:01,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:24:01,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:24:01,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:24:01,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:24:01,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:24:01,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:24:01,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:24:01,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:24:01,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:24:01,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:24:01,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:24:01,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:24:01,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:24:01,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:24:01,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:24:01,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:24:01,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:24:01,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:24:01,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:24:01,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:24:01,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:24:01,446 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:24:01,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:24:01,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:24:01,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:24:01,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:24:01,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:24:01,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:24:01,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:24:01,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:24:01,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:24:01,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:24:01,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:24:01,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:24:01,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:24:01,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:24:01,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:24:01,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:24:01,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:24:01,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:24:01,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:24:01,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:24:01,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:24:01,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:24:01,451 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:24:01,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:24:01,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:24:01,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:24:01,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:24:01,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:24:01,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:24:01,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:24:01,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-18 22:24:01,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdd1a21/a63732ad3cef4f6383ff570d09204a10/FLAG562c3f1fb [2019-12-18 22:24:02,398 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:24:02,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-18 22:24:02,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdd1a21/a63732ad3cef4f6383ff570d09204a10/FLAG562c3f1fb [2019-12-18 22:24:02,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9bdd1a21/a63732ad3cef4f6383ff570d09204a10 [2019-12-18 22:24:02,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:24:02,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:24:02,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:24:02,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:24:02,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:24:02,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:02" (1/1) ... [2019-12-18 22:24:02,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908c1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:02, skipping insertion in model container [2019-12-18 22:24:02,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:02" (1/1) ... [2019-12-18 22:24:02,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:24:02,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:24:03,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:24:03,392 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:24:03,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:24:03,563 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:24:03,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03 WrapperNode [2019-12-18 22:24:03,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:24:03,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:24:03,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:24:03,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:24:03,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:24:03,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:24:03,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:24:03,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:24:03,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... [2019-12-18 22:24:03,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:24:03,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:24:03,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:24:03,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:24:03,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:24:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:24:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:24:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:24:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:24:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:24:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:24:03,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:24:03,752 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:24:04,425 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:24:04,425 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:24:04,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:04 BoogieIcfgContainer [2019-12-18 22:24:04,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:24:04,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:24:04,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:24:04,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:24:04,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:24:02" (1/3) ... [2019-12-18 22:24:04,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b73c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:04, skipping insertion in model container [2019-12-18 22:24:04,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:03" (2/3) ... [2019-12-18 22:24:04,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b73c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:04, skipping insertion in model container [2019-12-18 22:24:04,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:04" (3/3) ... [2019-12-18 22:24:04,439 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc.i [2019-12-18 22:24:04,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:24:04,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:24:04,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:24:04,465 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:24:04,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,524 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,557 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,599 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,611 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:04,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:24:04,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:24:04,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:24:04,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:24:04,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:24:04,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:24:04,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:24:04,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:24:04,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:24:04,676 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:24:04,679 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:24:04,777 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:24:04,777 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:24:04,795 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:24:04,821 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:24:04,868 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:24:04,868 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:24:04,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:24:04,904 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:24:04,906 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:24:05,083 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 22:24:08,616 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:24:08,746 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:24:08,829 INFO L206 etLargeBlockEncoding]: Checked pairs total: 69182 [2019-12-18 22:24:08,830 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 22:24:08,833 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:24:22,096 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:24:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:24:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:24:22,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:22,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:24:22,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 794638691, now seen corresponding path program 1 times [2019-12-18 22:24:22,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:22,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935414780] [2019-12-18 22:24:22,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:24:22,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935414780] [2019-12-18 22:24:22,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:22,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:24:22,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031036378] [2019-12-18 22:24:22,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:24:22,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:24:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:24:22,405 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:24:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:24,822 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:24:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:24:24,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:24:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:24:25,385 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:24:25,385 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:24:25,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:24:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:24:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:24:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:24:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:24:35,021 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:24:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:24:35,022 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:24:35,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:24:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:24:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:24:35,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:35,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:24:35,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2064286334, now seen corresponding path program 1 times [2019-12-18 22:24:35,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:35,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063731413] [2019-12-18 22:24:35,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:24:35,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063731413] [2019-12-18 22:24:35,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:35,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:24:35,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247009552] [2019-12-18 22:24:35,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:24:35,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:24:35,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:24:35,193 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:24:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:39,694 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:24:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:24:39,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:24:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:24:40,310 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:24:40,311 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:24:40,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:24:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:24:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:24:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:24:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:24:46,656 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:24:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:24:46,657 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:24:46,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:24:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:24:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:24:46,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:46,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:24:46,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:46,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1769810709, now seen corresponding path program 1 times [2019-12-18 22:24:46,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:46,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999510571] [2019-12-18 22:24:46,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:24:46,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999510571] [2019-12-18 22:24:46,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:46,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:24:46,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934640431] [2019-12-18 22:24:46,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:24:46,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:46,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:24:46,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:24:46,814 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:24:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:51,216 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-18 22:24:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:24:51,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:24:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:24:51,711 INFO L225 Difference]: With dead ends: 161841 [2019-12-18 22:24:51,712 INFO L226 Difference]: Without dead ends: 161729 [2019-12-18 22:24:51,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:24:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-18 22:24:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-18 22:24:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-18 22:25:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-18 22:25:05,926 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-18 22:25:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:05,926 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-18 22:25:05,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:25:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-18 22:25:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:05,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:05,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:05,930 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash 37773354, now seen corresponding path program 1 times [2019-12-18 22:25:05,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:05,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050324513] [2019-12-18 22:25:05,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:05,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050324513] [2019-12-18 22:25:05,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:05,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:25:05,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433778882] [2019-12-18 22:25:05,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:25:05,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:25:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:25:05,979 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-18 22:25:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:06,902 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-18 22:25:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:25:06,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:25:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:09,116 INFO L225 Difference]: With dead ends: 181948 [2019-12-18 22:25:09,117 INFO L226 Difference]: Without dead ends: 181948 [2019-12-18 22:25:09,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:25:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-18 22:25:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-18 22:25:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-18 22:25:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-18 22:25:22,670 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-18 22:25:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:22,670 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-18 22:25:22,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:25:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-18 22:25:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:22,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:22,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:22,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:22,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 37638690, now seen corresponding path program 1 times [2019-12-18 22:25:22,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:22,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714680900] [2019-12-18 22:25:22,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:22,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714680900] [2019-12-18 22:25:22,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:22,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:25:22,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767781725] [2019-12-18 22:25:22,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:25:22,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:25:22,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:25:22,763 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-18 22:25:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:24,807 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-18 22:25:24,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:25:24,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:25:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:25,356 INFO L225 Difference]: With dead ends: 176806 [2019-12-18 22:25:25,356 INFO L226 Difference]: Without dead ends: 176726 [2019-12-18 22:25:25,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:25:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-18 22:25:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-18 22:25:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-18 22:25:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-18 22:25:38,623 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-18 22:25:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:38,624 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-18 22:25:38,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:25:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-18 22:25:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:38,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:38,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:38,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash 197780815, now seen corresponding path program 1 times [2019-12-18 22:25:38,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:38,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055123239] [2019-12-18 22:25:38,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:38,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055123239] [2019-12-18 22:25:38,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:38,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:25:38,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40247551] [2019-12-18 22:25:38,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:25:38,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:25:38,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:25:38,693 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-18 22:25:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:39,719 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-18 22:25:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:25:39,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:25:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:46,407 INFO L225 Difference]: With dead ends: 181899 [2019-12-18 22:25:46,408 INFO L226 Difference]: Without dead ends: 181811 [2019-12-18 22:25:46,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:25:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-18 22:25:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-18 22:25:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-18 22:25:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-18 22:25:53,465 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-18 22:25:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:53,465 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-18 22:25:53,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:25:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-18 22:25:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:25:53,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:53,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:53,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -538416332, now seen corresponding path program 1 times [2019-12-18 22:25:53,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:53,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054756749] [2019-12-18 22:25:53,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:53,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 22:25:53,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054756749] [2019-12-18 22:25:53,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:53,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:25:53,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130404501] [2019-12-18 22:25:53,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:25:53,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:25:53,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:25:53,534 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-18 22:25:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:55,378 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-18 22:25:55,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:25:55,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:25:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:55,854 INFO L225 Difference]: With dead ends: 155313 [2019-12-18 22:25:55,854 INFO L226 Difference]: Without dead ends: 155313 [2019-12-18 22:25:55,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-18 22:26:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-18 22:26:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-18 22:26:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-18 22:26:08,324 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-18 22:26:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:08,324 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-18 22:26:08,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-18 22:26:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:26:08,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:08,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:08,349 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash -919407984, now seen corresponding path program 1 times [2019-12-18 22:26:08,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:08,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474531415] [2019-12-18 22:26:08,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:08,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474531415] [2019-12-18 22:26:08,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:08,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:08,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623261873] [2019-12-18 22:26:08,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:26:08,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:26:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:26:08,401 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-18 22:26:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:17,451 INFO L93 Difference]: Finished difference Result 286953 states and 1185326 transitions. [2019-12-18 22:26:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:26:17,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:26:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:18,002 INFO L225 Difference]: With dead ends: 286953 [2019-12-18 22:26:18,003 INFO L226 Difference]: Without dead ends: 164501 [2019-12-18 22:26:18,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164501 states. [2019-12-18 22:26:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164501 to 163553. [2019-12-18 22:26:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163553 states. [2019-12-18 22:26:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163553 states to 163553 states and 668264 transitions. [2019-12-18 22:26:24,915 INFO L78 Accepts]: Start accepts. Automaton has 163553 states and 668264 transitions. Word has length 19 [2019-12-18 22:26:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:24,916 INFO L462 AbstractCegarLoop]: Abstraction has 163553 states and 668264 transitions. [2019-12-18 22:26:24,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:26:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 163553 states and 668264 transitions. [2019-12-18 22:26:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:26:24,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:24,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:24,935 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:24,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash -112975457, now seen corresponding path program 1 times [2019-12-18 22:26:24,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:24,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416629808] [2019-12-18 22:26:24,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:25,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416629808] [2019-12-18 22:26:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:25,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:25,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244763403] [2019-12-18 22:26:25,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:26:25,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:26:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:26:25,037 INFO L87 Difference]: Start difference. First operand 163553 states and 668264 transitions. Second operand 4 states. [2019-12-18 22:26:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:26,495 INFO L93 Difference]: Finished difference Result 47936 states and 164340 transitions. [2019-12-18 22:26:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:26:26,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:26:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:26,565 INFO L225 Difference]: With dead ends: 47936 [2019-12-18 22:26:26,565 INFO L226 Difference]: Without dead ends: 37198 [2019-12-18 22:26:26,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37198 states. [2019-12-18 22:26:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37198 to 36765. [2019-12-18 22:26:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36765 states. [2019-12-18 22:26:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36765 states to 36765 states and 121273 transitions. [2019-12-18 22:26:27,178 INFO L78 Accepts]: Start accepts. Automaton has 36765 states and 121273 transitions. Word has length 19 [2019-12-18 22:26:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:27,178 INFO L462 AbstractCegarLoop]: Abstraction has 36765 states and 121273 transitions. [2019-12-18 22:26:27,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:26:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36765 states and 121273 transitions. [2019-12-18 22:26:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:26:27,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:27,186 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 22:26:27,186 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -299881963, now seen corresponding path program 1 times [2019-12-18 22:26:27,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938762894] [2019-12-18 22:26:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:27,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938762894] [2019-12-18 22:26:27,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323223919] [2019-12-18 22:26:27,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:27,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:27,287 INFO L87 Difference]: Start difference. First operand 36765 states and 121273 transitions. Second operand 5 states. [2019-12-18 22:26:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:27,914 INFO L93 Difference]: Finished difference Result 49671 states and 160913 transitions. [2019-12-18 22:26:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:26:27,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:26:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:27,998 INFO L225 Difference]: With dead ends: 49671 [2019-12-18 22:26:27,999 INFO L226 Difference]: Without dead ends: 49369 [2019-12-18 22:26:27,999 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 22:26:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49369 states. [2019-12-18 22:26:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49369 to 37450. [2019-12-18 22:26:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37450 states. [2019-12-18 22:26:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37450 states to 37450 states and 123479 transitions. [2019-12-18 22:26:31,095 INFO L78 Accepts]: Start accepts. Automaton has 37450 states and 123479 transitions. Word has length 22 [2019-12-18 22:26:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:31,096 INFO L462 AbstractCegarLoop]: Abstraction has 37450 states and 123479 transitions. [2019-12-18 22:26:31,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 37450 states and 123479 transitions. [2019-12-18 22:26:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:26:31,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:31,104 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 22:26:31,104 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash -863346088, now seen corresponding path program 1 times [2019-12-18 22:26:31,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:31,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95513617] [2019-12-18 22:26:31,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95513617] [2019-12-18 22:26:31,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:31,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:31,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932515363] [2019-12-18 22:26:31,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:31,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:31,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:31,175 INFO L87 Difference]: Start difference. First operand 37450 states and 123479 transitions. Second operand 5 states. [2019-12-18 22:26:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:31,772 INFO L93 Difference]: Finished difference Result 49503 states and 160288 transitions. [2019-12-18 22:26:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:26:31,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:26:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:31,867 INFO L225 Difference]: With dead ends: 49503 [2019-12-18 22:26:31,867 INFO L226 Difference]: Without dead ends: 49103 [2019-12-18 22:26:31,867 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 22:26:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49103 states. [2019-12-18 22:26:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49103 to 34856. [2019-12-18 22:26:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34856 states. [2019-12-18 22:26:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34856 states to 34856 states and 114857 transitions. [2019-12-18 22:26:32,911 INFO L78 Accepts]: Start accepts. Automaton has 34856 states and 114857 transitions. Word has length 22 [2019-12-18 22:26:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:32,912 INFO L462 AbstractCegarLoop]: Abstraction has 34856 states and 114857 transitions. [2019-12-18 22:26:32,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34856 states and 114857 transitions. [2019-12-18 22:26:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:26:32,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:32,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:32,924 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2029037298, now seen corresponding path program 1 times [2019-12-18 22:26:32,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:32,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058130767] [2019-12-18 22:26:32,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:33,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058130767] [2019-12-18 22:26:33,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:33,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:26:33,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872403975] [2019-12-18 22:26:33,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:26:33,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:26:33,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:33,073 INFO L87 Difference]: Start difference. First operand 34856 states and 114857 transitions. Second operand 7 states. [2019-12-18 22:26:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:33,708 INFO L93 Difference]: Finished difference Result 47602 states and 153640 transitions. [2019-12-18 22:26:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:26:33,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 22:26:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:33,796 INFO L225 Difference]: With dead ends: 47602 [2019-12-18 22:26:33,796 INFO L226 Difference]: Without dead ends: 47182 [2019-12-18 22:26:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47182 states. [2019-12-18 22:26:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47182 to 38234. [2019-12-18 22:26:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38234 states. [2019-12-18 22:26:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38234 states to 38234 states and 125445 transitions. [2019-12-18 22:26:34,538 INFO L78 Accepts]: Start accepts. Automaton has 38234 states and 125445 transitions. Word has length 25 [2019-12-18 22:26:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:34,538 INFO L462 AbstractCegarLoop]: Abstraction has 38234 states and 125445 transitions. [2019-12-18 22:26:34,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:26:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38234 states and 125445 transitions. [2019-12-18 22:26:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:26:34,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:34,557 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 22:26:34,557 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2090157818, now seen corresponding path program 1 times [2019-12-18 22:26:34,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:34,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448610232] [2019-12-18 22:26:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:34,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448610232] [2019-12-18 22:26:34,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:34,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:34,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105199389] [2019-12-18 22:26:34,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:34,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:34,649 INFO L87 Difference]: Start difference. First operand 38234 states and 125445 transitions. Second operand 5 states. [2019-12-18 22:26:35,010 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-18 22:26:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:35,448 INFO L93 Difference]: Finished difference Result 48700 states and 158159 transitions. [2019-12-18 22:26:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:26:35,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:26:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:35,534 INFO L225 Difference]: With dead ends: 48700 [2019-12-18 22:26:35,535 INFO L226 Difference]: Without dead ends: 48326 [2019-12-18 22:26:35,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48326 states. [2019-12-18 22:26:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48326 to 40013. [2019-12-18 22:26:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2019-12-18 22:26:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 131257 transitions. [2019-12-18 22:26:36,307 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 131257 transitions. Word has length 28 [2019-12-18 22:26:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:36,307 INFO L462 AbstractCegarLoop]: Abstraction has 40013 states and 131257 transitions. [2019-12-18 22:26:36,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 131257 transitions. [2019-12-18 22:26:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:26:36,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:36,330 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 22:26:36,330 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash -893146615, now seen corresponding path program 1 times [2019-12-18 22:26:36,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:36,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640907197] [2019-12-18 22:26:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:36,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640907197] [2019-12-18 22:26:36,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:36,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:36,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343508270] [2019-12-18 22:26:36,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:36,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:36,376 INFO L87 Difference]: Start difference. First operand 40013 states and 131257 transitions. Second operand 3 states. [2019-12-18 22:26:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:36,691 INFO L93 Difference]: Finished difference Result 52067 states and 169326 transitions. [2019-12-18 22:26:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:36,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 22:26:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:36,850 INFO L225 Difference]: With dead ends: 52067 [2019-12-18 22:26:36,850 INFO L226 Difference]: Without dead ends: 52067 [2019-12-18 22:26:36,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52067 states. [2019-12-18 22:26:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52067 to 41845. [2019-12-18 22:26:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41845 states. [2019-12-18 22:26:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41845 states to 41845 states and 134913 transitions. [2019-12-18 22:26:38,051 INFO L78 Accepts]: Start accepts. Automaton has 41845 states and 134913 transitions. Word has length 28 [2019-12-18 22:26:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:38,051 INFO L462 AbstractCegarLoop]: Abstraction has 41845 states and 134913 transitions. [2019-12-18 22:26:38,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41845 states and 134913 transitions. [2019-12-18 22:26:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 22:26:38,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:38,077 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] [2019-12-18 22:26:38,077 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1145073619, now seen corresponding path program 1 times [2019-12-18 22:26:38,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:38,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888653724] [2019-12-18 22:26:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:38,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888653724] [2019-12-18 22:26:38,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:38,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:26:38,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230874775] [2019-12-18 22:26:38,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:38,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:38,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:38,162 INFO L87 Difference]: Start difference. First operand 41845 states and 134913 transitions. Second operand 5 states. [2019-12-18 22:26:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:38,289 INFO L93 Difference]: Finished difference Result 18540 states and 55506 transitions. [2019-12-18 22:26:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:26:38,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 22:26:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:38,329 INFO L225 Difference]: With dead ends: 18540 [2019-12-18 22:26:38,329 INFO L226 Difference]: Without dead ends: 15811 [2019-12-18 22:26:38,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15811 states. [2019-12-18 22:26:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15811 to 15155. [2019-12-18 22:26:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15155 states. [2019-12-18 22:26:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15155 states to 15155 states and 45019 transitions. [2019-12-18 22:26:38,710 INFO L78 Accepts]: Start accepts. Automaton has 15155 states and 45019 transitions. Word has length 29 [2019-12-18 22:26:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:38,710 INFO L462 AbstractCegarLoop]: Abstraction has 15155 states and 45019 transitions. [2019-12-18 22:26:38,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15155 states and 45019 transitions. [2019-12-18 22:26:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:26:38,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:38,734 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 22:26:38,734 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1336056649, now seen corresponding path program 1 times [2019-12-18 22:26:38,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:38,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173279327] [2019-12-18 22:26:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:38,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173279327] [2019-12-18 22:26:38,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:38,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:38,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643611562] [2019-12-18 22:26:38,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:38,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:38,779 INFO L87 Difference]: Start difference. First operand 15155 states and 45019 transitions. Second operand 3 states. [2019-12-18 22:26:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:38,868 INFO L93 Difference]: Finished difference Result 22100 states and 66786 transitions. [2019-12-18 22:26:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:26:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:38,881 INFO L225 Difference]: With dead ends: 22100 [2019-12-18 22:26:38,882 INFO L226 Difference]: Without dead ends: 9395 [2019-12-18 22:26:38,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2019-12-18 22:26:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 9298. [2019-12-18 22:26:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-18 22:26:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 27243 transitions. [2019-12-18 22:26:39,012 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 27243 transitions. Word has length 39 [2019-12-18 22:26:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 27243 transitions. [2019-12-18 22:26:39,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 27243 transitions. [2019-12-18 22:26:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:26:39,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:39,023 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 22:26:39,024 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash -210063419, now seen corresponding path program 1 times [2019-12-18 22:26:39,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:39,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418077997] [2019-12-18 22:26:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:39,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418077997] [2019-12-18 22:26:39,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:39,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:26:39,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553191060] [2019-12-18 22:26:39,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:26:39,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:26:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:26:39,116 INFO L87 Difference]: Start difference. First operand 9298 states and 27243 transitions. Second operand 6 states. [2019-12-18 22:26:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:39,509 INFO L93 Difference]: Finished difference Result 9722 states and 28149 transitions. [2019-12-18 22:26:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:26:39,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:26:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:39,523 INFO L225 Difference]: With dead ends: 9722 [2019-12-18 22:26:39,524 INFO L226 Difference]: Without dead ends: 9555 [2019-12-18 22:26:39,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:26:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2019-12-18 22:26:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9267. [2019-12-18 22:26:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2019-12-18 22:26:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 27196 transitions. [2019-12-18 22:26:39,652 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 27196 transitions. Word has length 40 [2019-12-18 22:26:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:39,652 INFO L462 AbstractCegarLoop]: Abstraction has 9267 states and 27196 transitions. [2019-12-18 22:26:39,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:26:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 27196 transitions. [2019-12-18 22:26:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:26:39,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:39,664 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 22:26:39,664 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1917096257, now seen corresponding path program 1 times [2019-12-18 22:26:39,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:39,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033110228] [2019-12-18 22:26:39,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:39,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033110228] [2019-12-18 22:26:39,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:39,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:39,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490254991] [2019-12-18 22:26:39,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:39,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:39,736 INFO L87 Difference]: Start difference. First operand 9267 states and 27196 transitions. Second operand 3 states. [2019-12-18 22:26:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:39,783 INFO L93 Difference]: Finished difference Result 8801 states and 25321 transitions. [2019-12-18 22:26:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:39,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 22:26:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:39,794 INFO L225 Difference]: With dead ends: 8801 [2019-12-18 22:26:39,795 INFO L226 Difference]: Without dead ends: 8801 [2019-12-18 22:26:39,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8801 states. [2019-12-18 22:26:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8801 to 8801. [2019-12-18 22:26:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8801 states. [2019-12-18 22:26:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 25321 transitions. [2019-12-18 22:26:39,909 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 25321 transitions. Word has length 40 [2019-12-18 22:26:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:39,910 INFO L462 AbstractCegarLoop]: Abstraction has 8801 states and 25321 transitions. [2019-12-18 22:26:39,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 25321 transitions. [2019-12-18 22:26:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:26:39,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:39,921 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] [2019-12-18 22:26:39,921 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1341792848, now seen corresponding path program 1 times [2019-12-18 22:26:39,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:39,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989993008] [2019-12-18 22:26:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:40,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989993008] [2019-12-18 22:26:40,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:40,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:26:40,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832387770] [2019-12-18 22:26:40,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:26:40,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:26:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:26:40,005 INFO L87 Difference]: Start difference. First operand 8801 states and 25321 transitions. Second operand 6 states. [2019-12-18 22:26:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:40,102 INFO L93 Difference]: Finished difference Result 7726 states and 22682 transitions. [2019-12-18 22:26:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:26:40,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:26:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:40,114 INFO L225 Difference]: With dead ends: 7726 [2019-12-18 22:26:40,114 INFO L226 Difference]: Without dead ends: 5811 [2019-12-18 22:26:40,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2019-12-18 22:26:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 5811. [2019-12-18 22:26:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5811 states. [2019-12-18 22:26:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 18315 transitions. [2019-12-18 22:26:40,216 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 18315 transitions. Word has length 41 [2019-12-18 22:26:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:40,216 INFO L462 AbstractCegarLoop]: Abstraction has 5811 states and 18315 transitions. [2019-12-18 22:26:40,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:26:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 18315 transitions. [2019-12-18 22:26:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:40,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:40,226 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] [2019-12-18 22:26:40,226 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -602506042, now seen corresponding path program 1 times [2019-12-18 22:26:40,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:40,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302662729] [2019-12-18 22:26:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:40,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302662729] [2019-12-18 22:26:40,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:40,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:26:40,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757029278] [2019-12-18 22:26:40,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:26:40,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:26:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:40,348 INFO L87 Difference]: Start difference. First operand 5811 states and 18315 transitions. Second operand 9 states. [2019-12-18 22:26:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:41,249 INFO L93 Difference]: Finished difference Result 11851 states and 36567 transitions. [2019-12-18 22:26:41,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:26:41,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:26:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:41,262 INFO L225 Difference]: With dead ends: 11851 [2019-12-18 22:26:41,263 INFO L226 Difference]: Without dead ends: 8451 [2019-12-18 22:26:41,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:26:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2019-12-18 22:26:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 7923. [2019-12-18 22:26:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7923 states. [2019-12-18 22:26:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7923 states to 7923 states and 24480 transitions. [2019-12-18 22:26:41,376 INFO L78 Accepts]: Start accepts. Automaton has 7923 states and 24480 transitions. Word has length 55 [2019-12-18 22:26:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:41,376 INFO L462 AbstractCegarLoop]: Abstraction has 7923 states and 24480 transitions. [2019-12-18 22:26:41,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:26:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7923 states and 24480 transitions. [2019-12-18 22:26:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:41,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:41,385 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] [2019-12-18 22:26:41,385 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -251826678, now seen corresponding path program 2 times [2019-12-18 22:26:41,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:41,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376015193] [2019-12-18 22:26:41,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:41,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376015193] [2019-12-18 22:26:41,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:41,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:26:41,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082918613] [2019-12-18 22:26:41,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:26:41,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:26:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:41,530 INFO L87 Difference]: Start difference. First operand 7923 states and 24480 transitions. Second operand 9 states. [2019-12-18 22:26:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:42,667 INFO L93 Difference]: Finished difference Result 14232 states and 42620 transitions. [2019-12-18 22:26:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:26:42,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:26:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:42,689 INFO L225 Difference]: With dead ends: 14232 [2019-12-18 22:26:42,689 INFO L226 Difference]: Without dead ends: 14112 [2019-12-18 22:26:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:26:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14112 states. [2019-12-18 22:26:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14112 to 11808. [2019-12-18 22:26:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11808 states. [2019-12-18 22:26:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11808 states to 11808 states and 35457 transitions. [2019-12-18 22:26:42,966 INFO L78 Accepts]: Start accepts. Automaton has 11808 states and 35457 transitions. Word has length 55 [2019-12-18 22:26:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:42,966 INFO L462 AbstractCegarLoop]: Abstraction has 11808 states and 35457 transitions. [2019-12-18 22:26:42,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:26:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 11808 states and 35457 transitions. [2019-12-18 22:26:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:42,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:42,979 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] [2019-12-18 22:26:42,979 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:42,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1901544958, now seen corresponding path program 3 times [2019-12-18 22:26:42,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:42,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525118516] [2019-12-18 22:26:42,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:43,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 22:26:43,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525118516] [2019-12-18 22:26:43,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:43,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 22:26:43,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420213536] [2019-12-18 22:26:43,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 22:26:43,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 22:26:43,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:26:43,546 INFO L87 Difference]: Start difference. First operand 11808 states and 35457 transitions. Second operand 18 states. [2019-12-18 22:26:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:47,380 INFO L93 Difference]: Finished difference Result 19525 states and 56497 transitions. [2019-12-18 22:26:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 22:26:47,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-18 22:26:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:47,405 INFO L225 Difference]: With dead ends: 19525 [2019-12-18 22:26:47,405 INFO L226 Difference]: Without dead ends: 16992 [2019-12-18 22:26:47,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 22:26:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2019-12-18 22:26:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12793. [2019-12-18 22:26:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12793 states. [2019-12-18 22:26:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12793 states to 12793 states and 38064 transitions. [2019-12-18 22:26:47,606 INFO L78 Accepts]: Start accepts. Automaton has 12793 states and 38064 transitions. Word has length 55 [2019-12-18 22:26:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:47,607 INFO L462 AbstractCegarLoop]: Abstraction has 12793 states and 38064 transitions. [2019-12-18 22:26:47,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 22:26:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 12793 states and 38064 transitions. [2019-12-18 22:26:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:47,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:47,621 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] [2019-12-18 22:26:47,621 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1993835228, now seen corresponding path program 4 times [2019-12-18 22:26:47,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:47,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129777693] [2019-12-18 22:26:47,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129777693] [2019-12-18 22:26:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:47,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:26:47,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592152267] [2019-12-18 22:26:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:26:47,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:26:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:26:47,987 INFO L87 Difference]: Start difference. First operand 12793 states and 38064 transitions. Second operand 15 states. [2019-12-18 22:26:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:50,379 INFO L93 Difference]: Finished difference Result 15426 states and 45395 transitions. [2019-12-18 22:26:50,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:26:50,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-18 22:26:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:50,401 INFO L225 Difference]: With dead ends: 15426 [2019-12-18 22:26:50,401 INFO L226 Difference]: Without dead ends: 14828 [2019-12-18 22:26:50,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:26:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14828 states. [2019-12-18 22:26:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14828 to 12924. [2019-12-18 22:26:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12924 states. [2019-12-18 22:26:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12924 states to 12924 states and 38407 transitions. [2019-12-18 22:26:50,591 INFO L78 Accepts]: Start accepts. Automaton has 12924 states and 38407 transitions. Word has length 55 [2019-12-18 22:26:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:50,591 INFO L462 AbstractCegarLoop]: Abstraction has 12924 states and 38407 transitions. [2019-12-18 22:26:50,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:26:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 12924 states and 38407 transitions. [2019-12-18 22:26:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:50,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:50,608 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] [2019-12-18 22:26:50,608 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:50,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash -873110788, now seen corresponding path program 5 times [2019-12-18 22:26:50,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:50,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605700679] [2019-12-18 22:26:50,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:51,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605700679] [2019-12-18 22:26:51,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:51,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 22:26:51,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47009559] [2019-12-18 22:26:51,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 22:26:51,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 22:26:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:26:51,055 INFO L87 Difference]: Start difference. First operand 12924 states and 38407 transitions. Second operand 18 states. [2019-12-18 22:26:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:53,932 INFO L93 Difference]: Finished difference Result 14101 states and 41529 transitions. [2019-12-18 22:26:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 22:26:53,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-18 22:26:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:53,952 INFO L225 Difference]: With dead ends: 14101 [2019-12-18 22:26:53,953 INFO L226 Difference]: Without dead ends: 13728 [2019-12-18 22:26:53,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 22:26:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2019-12-18 22:26:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 13009. [2019-12-18 22:26:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13009 states. [2019-12-18 22:26:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13009 states to 13009 states and 38656 transitions. [2019-12-18 22:26:54,132 INFO L78 Accepts]: Start accepts. Automaton has 13009 states and 38656 transitions. Word has length 55 [2019-12-18 22:26:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:54,132 INFO L462 AbstractCegarLoop]: Abstraction has 13009 states and 38656 transitions. [2019-12-18 22:26:54,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 22:26:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13009 states and 38656 transitions. [2019-12-18 22:26:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:26:54,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:54,146 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] [2019-12-18 22:26:54,146 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:54,147 INFO L82 PathProgramCache]: Analyzing trace with hash -727272106, now seen corresponding path program 6 times [2019-12-18 22:26:54,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:54,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386373056] [2019-12-18 22:26:54,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:54,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 22:26:54,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386373056] [2019-12-18 22:26:54,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:54,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:54,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027005895] [2019-12-18 22:26:54,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:54,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:54,198 INFO L87 Difference]: Start difference. First operand 13009 states and 38656 transitions. Second operand 3 states. [2019-12-18 22:26:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:54,252 INFO L93 Difference]: Finished difference Result 13007 states and 38651 transitions. [2019-12-18 22:26:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:54,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:26:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:54,275 INFO L225 Difference]: With dead ends: 13007 [2019-12-18 22:26:54,275 INFO L226 Difference]: Without dead ends: 13007 [2019-12-18 22:26:54,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states. [2019-12-18 22:26:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 11035. [2019-12-18 22:26:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11035 states. [2019-12-18 22:26:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11035 states to 11035 states and 33238 transitions. [2019-12-18 22:26:54,538 INFO L78 Accepts]: Start accepts. Automaton has 11035 states and 33238 transitions. Word has length 55 [2019-12-18 22:26:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:54,538 INFO L462 AbstractCegarLoop]: Abstraction has 11035 states and 33238 transitions. [2019-12-18 22:26:54,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11035 states and 33238 transitions. [2019-12-18 22:26:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:54,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:54,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:54,550 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1401618532, now seen corresponding path program 1 times [2019-12-18 22:26:54,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:54,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973669862] [2019-12-18 22:26:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:54,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973669862] [2019-12-18 22:26:54,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:54,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:26:54,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728976799] [2019-12-18 22:26:54,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:26:54,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:26:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:26:54,816 INFO L87 Difference]: Start difference. First operand 11035 states and 33238 transitions. Second operand 12 states. [2019-12-18 22:26:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:55,923 INFO L93 Difference]: Finished difference Result 17070 states and 51012 transitions. [2019-12-18 22:26:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:26:55,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:26:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:55,946 INFO L225 Difference]: With dead ends: 17070 [2019-12-18 22:26:55,946 INFO L226 Difference]: Without dead ends: 16216 [2019-12-18 22:26:55,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 22:26:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16216 states. [2019-12-18 22:26:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16216 to 13804. [2019-12-18 22:26:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13804 states. [2019-12-18 22:26:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 41469 transitions. [2019-12-18 22:26:56,159 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 41469 transitions. Word has length 56 [2019-12-18 22:26:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:56,159 INFO L462 AbstractCegarLoop]: Abstraction has 13804 states and 41469 transitions. [2019-12-18 22:26:56,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:26:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 41469 transitions. [2019-12-18 22:26:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:56,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:56,174 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] [2019-12-18 22:26:56,174 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash 295644280, now seen corresponding path program 2 times [2019-12-18 22:26:56,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:56,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175799346] [2019-12-18 22:26:56,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:56,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175799346] [2019-12-18 22:26:56,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:56,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:26:56,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080399473] [2019-12-18 22:26:56,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:26:56,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:26:56,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:26:56,593 INFO L87 Difference]: Start difference. First operand 13804 states and 41469 transitions. Second operand 14 states. [2019-12-18 22:26:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:58,854 INFO L93 Difference]: Finished difference Result 19892 states and 58363 transitions. [2019-12-18 22:26:58,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:26:58,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 22:26:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:58,879 INFO L225 Difference]: With dead ends: 19892 [2019-12-18 22:26:58,879 INFO L226 Difference]: Without dead ends: 18014 [2019-12-18 22:26:58,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:26:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18014 states. [2019-12-18 22:26:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18014 to 13896. [2019-12-18 22:26:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13896 states. [2019-12-18 22:26:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13896 states to 13896 states and 41613 transitions. [2019-12-18 22:26:59,221 INFO L78 Accepts]: Start accepts. Automaton has 13896 states and 41613 transitions. Word has length 56 [2019-12-18 22:26:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:59,221 INFO L462 AbstractCegarLoop]: Abstraction has 13896 states and 41613 transitions. [2019-12-18 22:26:59,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:26:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13896 states and 41613 transitions. [2019-12-18 22:26:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:59,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:59,235 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] [2019-12-18 22:26:59,236 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1301526412, now seen corresponding path program 3 times [2019-12-18 22:26:59,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:59,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665230135] [2019-12-18 22:26:59,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:59,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665230135] [2019-12-18 22:26:59,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:59,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:26:59,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773965903] [2019-12-18 22:26:59,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:26:59,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:26:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:26:59,445 INFO L87 Difference]: Start difference. First operand 13896 states and 41613 transitions. Second operand 12 states. [2019-12-18 22:27:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:00,823 INFO L93 Difference]: Finished difference Result 16847 states and 49693 transitions. [2019-12-18 22:27:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:27:00,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:27:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:00,844 INFO L225 Difference]: With dead ends: 16847 [2019-12-18 22:27:00,845 INFO L226 Difference]: Without dead ends: 15005 [2019-12-18 22:27:00,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:27:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15005 states. [2019-12-18 22:27:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15005 to 12767. [2019-12-18 22:27:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2019-12-18 22:27:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 38320 transitions. [2019-12-18 22:27:01,031 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 38320 transitions. Word has length 56 [2019-12-18 22:27:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:01,032 INFO L462 AbstractCegarLoop]: Abstraction has 12767 states and 38320 transitions. [2019-12-18 22:27:01,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:27:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 38320 transitions. [2019-12-18 22:27:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:01,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:01,045 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] [2019-12-18 22:27:01,045 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1331906746, now seen corresponding path program 4 times [2019-12-18 22:27:01,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:01,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43348952] [2019-12-18 22:27:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43348952] [2019-12-18 22:27:01,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:01,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:27:01,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969798407] [2019-12-18 22:27:01,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:27:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:27:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:27:01,310 INFO L87 Difference]: Start difference. First operand 12767 states and 38320 transitions. Second operand 13 states. [2019-12-18 22:27:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:02,819 INFO L93 Difference]: Finished difference Result 15948 states and 46921 transitions. [2019-12-18 22:27:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:27:02,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 22:27:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:02,840 INFO L225 Difference]: With dead ends: 15948 [2019-12-18 22:27:02,840 INFO L226 Difference]: Without dead ends: 14219 [2019-12-18 22:27:02,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:27:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2019-12-18 22:27:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 12769. [2019-12-18 22:27:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12769 states. [2019-12-18 22:27:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12769 states to 12769 states and 38257 transitions. [2019-12-18 22:27:03,025 INFO L78 Accepts]: Start accepts. Automaton has 12769 states and 38257 transitions. Word has length 56 [2019-12-18 22:27:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:03,025 INFO L462 AbstractCegarLoop]: Abstraction has 12769 states and 38257 transitions. [2019-12-18 22:27:03,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:27:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 12769 states and 38257 transitions. [2019-12-18 22:27:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:03,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:03,039 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] [2019-12-18 22:27:03,039 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash 678406116, now seen corresponding path program 5 times [2019-12-18 22:27:03,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:03,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838840919] [2019-12-18 22:27:03,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:03,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838840919] [2019-12-18 22:27:03,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:03,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 22:27:03,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434651831] [2019-12-18 22:27:03,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 22:27:03,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 22:27:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:27:03,698 INFO L87 Difference]: Start difference. First operand 12769 states and 38257 transitions. Second operand 20 states. [2019-12-18 22:27:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:08,625 INFO L93 Difference]: Finished difference Result 18687 states and 54199 transitions. [2019-12-18 22:27:08,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-18 22:27:08,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-18 22:27:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:08,648 INFO L225 Difference]: With dead ends: 18687 [2019-12-18 22:27:08,649 INFO L226 Difference]: Without dead ends: 17217 [2019-12-18 22:27:08,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 22:27:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17217 states. [2019-12-18 22:27:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17217 to 12836. [2019-12-18 22:27:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12836 states. [2019-12-18 22:27:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12836 states to 12836 states and 38419 transitions. [2019-12-18 22:27:08,854 INFO L78 Accepts]: Start accepts. Automaton has 12836 states and 38419 transitions. Word has length 56 [2019-12-18 22:27:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:08,854 INFO L462 AbstractCegarLoop]: Abstraction has 12836 states and 38419 transitions. [2019-12-18 22:27:08,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 22:27:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12836 states and 38419 transitions. [2019-12-18 22:27:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:08,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:08,867 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] [2019-12-18 22:27:08,868 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash -544192700, now seen corresponding path program 6 times [2019-12-18 22:27:08,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:08,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789820208] [2019-12-18 22:27:08,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:09,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789820208] [2019-12-18 22:27:09,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:09,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:27:09,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629156117] [2019-12-18 22:27:09,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:27:09,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:27:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:27:09,055 INFO L87 Difference]: Start difference. First operand 12836 states and 38419 transitions. Second operand 12 states. [2019-12-18 22:27:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:10,126 INFO L93 Difference]: Finished difference Result 14838 states and 43800 transitions. [2019-12-18 22:27:10,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:27:10,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:27:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:10,147 INFO L225 Difference]: With dead ends: 14838 [2019-12-18 22:27:10,147 INFO L226 Difference]: Without dead ends: 14424 [2019-12-18 22:27:10,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:27:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14424 states. [2019-12-18 22:27:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14424 to 12763. [2019-12-18 22:27:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12763 states. [2019-12-18 22:27:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12763 states to 12763 states and 38230 transitions. [2019-12-18 22:27:10,421 INFO L78 Accepts]: Start accepts. Automaton has 12763 states and 38230 transitions. Word has length 56 [2019-12-18 22:27:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:10,421 INFO L462 AbstractCegarLoop]: Abstraction has 12763 states and 38230 transitions. [2019-12-18 22:27:10,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:27:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12763 states and 38230 transitions. [2019-12-18 22:27:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:10,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:10,434 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] [2019-12-18 22:27:10,434 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1609576972, now seen corresponding path program 7 times [2019-12-18 22:27:10,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:10,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772653776] [2019-12-18 22:27:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:10,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772653776] [2019-12-18 22:27:10,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:10,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:27:10,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054296867] [2019-12-18 22:27:10,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:27:10,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:27:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:27:10,680 INFO L87 Difference]: Start difference. First operand 12763 states and 38230 transitions. Second operand 14 states. [2019-12-18 22:27:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:12,367 INFO L93 Difference]: Finished difference Result 15260 states and 45002 transitions. [2019-12-18 22:27:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 22:27:12,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 22:27:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:12,388 INFO L225 Difference]: With dead ends: 15260 [2019-12-18 22:27:12,388 INFO L226 Difference]: Without dead ends: 14227 [2019-12-18 22:27:12,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:27:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14227 states. [2019-12-18 22:27:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14227 to 12174. [2019-12-18 22:27:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12174 states. [2019-12-18 22:27:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12174 states to 12174 states and 36607 transitions. [2019-12-18 22:27:12,576 INFO L78 Accepts]: Start accepts. Automaton has 12174 states and 36607 transitions. Word has length 56 [2019-12-18 22:27:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:12,576 INFO L462 AbstractCegarLoop]: Abstraction has 12174 states and 36607 transitions. [2019-12-18 22:27:12,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:27:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12174 states and 36607 transitions. [2019-12-18 22:27:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:12,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:12,591 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] [2019-12-18 22:27:12,591 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash 581650494, now seen corresponding path program 8 times [2019-12-18 22:27:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349632485] [2019-12-18 22:27:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:13,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349632485] [2019-12-18 22:27:13,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:13,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:27:13,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602604840] [2019-12-18 22:27:13,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:27:13,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:27:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:27:13,145 INFO L87 Difference]: Start difference. First operand 12174 states and 36607 transitions. Second operand 16 states. [2019-12-18 22:27:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:15,998 INFO L93 Difference]: Finished difference Result 17614 states and 51464 transitions. [2019-12-18 22:27:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:27:15,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 22:27:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:16,021 INFO L225 Difference]: With dead ends: 17614 [2019-12-18 22:27:16,021 INFO L226 Difference]: Without dead ends: 16760 [2019-12-18 22:27:16,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 22:27:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16760 states. [2019-12-18 22:27:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16760 to 11934. [2019-12-18 22:27:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11934 states. [2019-12-18 22:27:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11934 states to 11934 states and 35955 transitions. [2019-12-18 22:27:16,320 INFO L78 Accepts]: Start accepts. Automaton has 11934 states and 35955 transitions. Word has length 56 [2019-12-18 22:27:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:16,320 INFO L462 AbstractCegarLoop]: Abstraction has 11934 states and 35955 transitions. [2019-12-18 22:27:16,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:27:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11934 states and 35955 transitions. [2019-12-18 22:27:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:16,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:16,334 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] [2019-12-18 22:27:16,334 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2002078782, now seen corresponding path program 9 times [2019-12-18 22:27:16,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:16,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555656076] [2019-12-18 22:27:16,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:27:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:27:16,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:27:16,435 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:27:16,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$w_buff1~0_24) (= 0 v_~x$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_22|) 0) (= 0 v_~x$r_buff0_thd1~0_73) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 |v_ULTIMATE.start_main_~#t1897~0.offset_18|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_22| 1)) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~x$r_buff1_thd2~0_18 0) (= v_~x$flush_delayed~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_23 0) (= v_~x$w_buff1_used~0_67 0) (= v_~y~0_16 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_22|) |v_ULTIMATE.start_main_~#t1897~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$w_buff0_used~0_113) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1897~0.base_22|) (= v_~x$mem_tmp~0_10 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1897~0.base_22| 4)) (= v_~x$r_buff1_thd0~0_20 0) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~weak$$choice0~0_6) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ULTIMATE.start_main_~#t1897~0.offset=|v_ULTIMATE.start_main_~#t1897~0.offset_18|, ULTIMATE.start_main_~#t1897~0.base=|v_ULTIMATE.start_main_~#t1897~0.base_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_14|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1897~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1897~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1899~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1898~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1898~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:27:16,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10|) |v_ULTIMATE.start_main_~#t1898~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1898~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1898~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1898~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1898~0.offset, #length] because there is no mapped edge [2019-12-18 22:27:16,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= 1 v_~x$w_buff0_used~0_68) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_12) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~x$w_buff1_used~0_40 256)) (= v_~x$w_buff1_used~0_40 v_~x$w_buff0_used~0_69) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_12, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:27:16,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1899~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11|) |v_ULTIMATE.start_main_~#t1899~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1899~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1899~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1899~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:27:16,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1360332123 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1360332123 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1360332123| ~x~0_In-1360332123)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1360332123 |P2Thread1of1ForFork1_#t~ite32_Out-1360332123|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1360332123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360332123, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1360332123, ~x~0=~x~0_In-1360332123} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1360332123|, ~x$w_buff1~0=~x$w_buff1~0_In-1360332123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360332123, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1360332123, ~x~0=~x~0_In-1360332123} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:27:16,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:27:16,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-751448761 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-751448761 256)))) (or (and (= ~x$w_buff0_used~0_In-751448761 |P2Thread1of1ForFork1_#t~ite34_Out-751448761|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-751448761|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-751448761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751448761} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-751448761|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-751448761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751448761} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:27:16,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1719490122 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out-1719490122| ~x$w_buff0~0_In-1719490122) (= |P0Thread1of1ForFork2_#t~ite8_In-1719490122| |P0Thread1of1ForFork2_#t~ite8_Out-1719490122|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1719490122| |P0Thread1of1ForFork2_#t~ite8_Out-1719490122|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1719490122 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1719490122 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-1719490122 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1719490122 256)) .cse1))) (= ~x$w_buff0~0_In-1719490122 |P0Thread1of1ForFork2_#t~ite8_Out-1719490122|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1719490122, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1719490122, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1719490122|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1719490122, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1719490122, ~weak$$choice2~0=~weak$$choice2~0_In-1719490122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1719490122} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1719490122, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1719490122, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1719490122|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1719490122, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1719490122|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1719490122, ~weak$$choice2~0=~weak$$choice2~0_In-1719490122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1719490122} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:27:16,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In178189125 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In178189125 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In178189125 |P1Thread1of1ForFork0_#t~ite28_Out178189125|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out178189125|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In178189125, ~x$w_buff0_used~0=~x$w_buff0_used~0_In178189125} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In178189125, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out178189125|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In178189125} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:27:16,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-794903034 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-794903034 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-794903034 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-794903034 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-794903034| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-794903034| ~x$w_buff1_used~0_In-794903034) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-794903034, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-794903034, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-794903034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-794903034} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-794903034, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-794903034, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-794903034, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-794903034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-794903034} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:27:16,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1770913706 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1770913706 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1770913706) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1770913706 ~x$r_buff0_thd2~0_Out1770913706)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1770913706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1770913706} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1770913706|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1770913706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1770913706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:27:16,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In367896371 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In367896371 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In367896371 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In367896371 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In367896371 |P1Thread1of1ForFork0_#t~ite31_Out367896371|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out367896371|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In367896371, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In367896371, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In367896371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367896371} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out367896371|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367896371, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In367896371, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In367896371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In367896371} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:27:16,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:27:16,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In2139258138 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2139258138 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2139258138 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2139258138 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2139258138 |P2Thread1of1ForFork1_#t~ite35_Out2139258138|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out2139258138| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2139258138, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2139258138, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2139258138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2139258138} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2139258138|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2139258138, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2139258138, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2139258138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2139258138} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:27:16,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-229723750 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-229723750 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-229723750| ~x$r_buff0_thd3~0_In-229723750)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-229723750| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229723750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229723750} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-229723750|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-229723750, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229723750} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:27:16,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In105093058 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out105093058| ~x$w_buff1_used~0_In105093058) (= |P0Thread1of1ForFork2_#t~ite18_Out105093058| |P0Thread1of1ForFork2_#t~ite17_Out105093058|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In105093058 256)))) (or (and (= (mod ~x$w_buff1_used~0_In105093058 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In105093058 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In105093058 256) 0))))) (and (= |P0Thread1of1ForFork2_#t~ite18_Out105093058| ~x$w_buff1_used~0_In105093058) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In105093058| |P0Thread1of1ForFork2_#t~ite17_Out105093058|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In105093058, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In105093058|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In105093058, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In105093058, ~weak$$choice2~0=~weak$$choice2~0_In105093058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In105093058} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In105093058, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out105093058|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out105093058|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In105093058, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In105093058, ~weak$$choice2~0=~weak$$choice2~0_In105093058, ~x$w_buff0_used~0=~x$w_buff0_used~0_In105093058} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:27:16,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_56 v_~x$r_buff0_thd1~0_55) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:27:16,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1053975859 256) 0)) (.cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out1053975859| |P0Thread1of1ForFork2_#t~ite23_Out1053975859|)) (.cse4 (= 0 (mod ~x$r_buff1_thd1~0_In1053975859 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1053975859 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In1053975859 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1053975859 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In1053975859| |P0Thread1of1ForFork2_#t~ite22_Out1053975859|) (or (and .cse0 (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) (= ~x$r_buff1_thd1~0_In1053975859 |P0Thread1of1ForFork2_#t~ite23_Out1053975859|) .cse5) (and (= |P0Thread1of1ForFork2_#t~ite24_Out1053975859| ~x$r_buff1_thd1~0_In1053975859) (not .cse5) (= |P0Thread1of1ForFork2_#t~ite23_Out1053975859| |P0Thread1of1ForFork2_#t~ite23_In1053975859|)))) (let ((.cse6 (not .cse2))) (and (= |P0Thread1of1ForFork2_#t~ite22_Out1053975859| |P0Thread1of1ForFork2_#t~ite23_Out1053975859|) (not .cse3) .cse0 (or .cse6 (not .cse4)) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out1053975859|) (or (not .cse1) .cse6) .cse5)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053975859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1053975859, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1053975859, ~weak$$choice2~0=~weak$$choice2~0_In1053975859, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1053975859|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1053975859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053975859} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053975859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1053975859, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1053975859, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1053975859|, ~weak$$choice2~0=~weak$$choice2~0_In1053975859, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1053975859|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1053975859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1053975859} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:27:16,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1781719885 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1781719885 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1781719885 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1781719885 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1781719885| ~x$r_buff1_thd3~0_In1781719885)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite37_Out1781719885| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1781719885, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1781719885, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1781719885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1781719885} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1781719885|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1781719885, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1781719885, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1781719885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1781719885} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:27:16,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:27:16,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:27:16,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:27:16,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-886851765 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-886851765 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-886851765| ~x~0_In-886851765) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-886851765 |ULTIMATE.start_main_#t~ite41_Out-886851765|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-886851765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886851765, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-886851765, ~x~0=~x~0_In-886851765} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-886851765|, ~x$w_buff1~0=~x$w_buff1~0_In-886851765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886851765, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-886851765, ~x~0=~x~0_In-886851765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:27:16,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:27:16,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In835370935 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In835370935 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out835370935| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out835370935| ~x$w_buff0_used~0_In835370935) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In835370935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In835370935} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In835370935, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out835370935|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In835370935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:27:16,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In18944303 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In18944303 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In18944303 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In18944303 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out18944303| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out18944303| ~x$w_buff1_used~0_In18944303) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In18944303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In18944303, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In18944303, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18944303} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In18944303, ~x$w_buff1_used~0=~x$w_buff1_used~0_In18944303, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In18944303, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out18944303|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18944303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:27:16,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-482867512 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-482867512 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-482867512| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-482867512| ~x$r_buff0_thd0~0_In-482867512)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-482867512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482867512} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-482867512, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-482867512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482867512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:27:16,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-498228362 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-498228362 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-498228362 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-498228362 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-498228362| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-498228362| ~x$r_buff1_thd0~0_In-498228362) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-498228362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498228362, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-498228362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498228362} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-498228362, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-498228362|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-498228362, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-498228362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-498228362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:27:16,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_11 2) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:27:16,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:27:16 BasicIcfg [2019-12-18 22:27:16,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:27:16,567 INFO L168 Benchmark]: Toolchain (without parser) took 193826.46 ms. Allocated memory was 138.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 670.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,567 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.76 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 155.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.01 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,569 INFO L168 Benchmark]: Boogie Preprocessor took 37.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,569 INFO L168 Benchmark]: RCFGBuilder took 761.65 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,569 INFO L168 Benchmark]: TraceAbstraction took 192134.33 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 610.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:16,572 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.76 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.76 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 155.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.01 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.39 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.65 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 103.7 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192134.33 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 610.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 6606 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 69182 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 191.7s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 72.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5493 SDtfs, 8679 SDslu, 21829 SDs, 0 SdLazy, 24688 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 39 SyntacticMatches, 27 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3292 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163553occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 94.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 211065 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1188 ConstructedInterpolants, 0 QuantifiedInterpolants, 415961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...