/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/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:44:06,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:44:06,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:44:06,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:44:06,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:44:06,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:44:06,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:44:06,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:44:06,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:44:06,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:44:06,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:44:06,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:44:06,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:44:06,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:44:06,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:44:06,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:44:06,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:44:06,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:44:06,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:44:06,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:44:06,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:44:06,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:44:06,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:44:06,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:44:06,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:44:06,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:44:06,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:44:06,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:44:06,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:44:06,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:44:06,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:44:06,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:44:06,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:44:06,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:44:06,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:44:06,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:44:06,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:44:06,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:44:06,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:44:06,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:44:06,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:44:06,443 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-27 04:44:06,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:44:06,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:44:06,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:44:06,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:44:06,468 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:44:06,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:44:06,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:44:06,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:44:06,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:44:06,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:44:06,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:44:06,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:44:06,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:44:06,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:44:06,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:44:06,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:44:06,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:44:06,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:44:06,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:44:06,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:44:06,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:44:06,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:44:06,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:44:06,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:44:06,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:44:06,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:44:06,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:44:06,474 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:44:06,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:44:06,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:44:06,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:44:06,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:44:06,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:44:06,752 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:44:06,752 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:44:06,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 04:44:06,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4974b56/c338b188faa94315957335cadf93b339/FLAG8b4741bc4 [2019-12-27 04:44:07,363 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:44:07,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 04:44:07,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4974b56/c338b188faa94315957335cadf93b339/FLAG8b4741bc4 [2019-12-27 04:44:07,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4974b56/c338b188faa94315957335cadf93b339 [2019-12-27 04:44:07,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:44:07,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:44:07,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:44:07,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:44:07,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:44:07,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:07" (1/1) ... [2019-12-27 04:44:07,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b87bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:07, skipping insertion in model container [2019-12-27 04:44:07,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:07" (1/1) ... [2019-12-27 04:44:07,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:44:07,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:44:08,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:44:08,230 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:44:08,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:44:08,362 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:44:08,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08 WrapperNode [2019-12-27 04:44:08,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:44:08,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:44:08,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:44:08,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:44:08,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:44:08,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:44:08,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:44:08,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:44:08,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (1/1) ... [2019-12-27 04:44:08,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:44:08,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:44:08,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:44:08,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:44:08,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (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-27 04:44:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 04:44:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 04:44:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 04:44:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 04:44:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:44:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:44:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:44:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:44:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:44:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:44:08,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:44:08,518 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:44:08,857 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:44:08,857 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 04:44:08,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:08 BoogieIcfgContainer [2019-12-27 04:44:08,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:44:08,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:44:08,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:44:08,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:44:08,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:44:07" (1/3) ... [2019-12-27 04:44:08,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e730a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:08, skipping insertion in model container [2019-12-27 04:44:08,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:08" (2/3) ... [2019-12-27 04:44:08,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e730a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:08, skipping insertion in model container [2019-12-27 04:44:08,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:08" (3/3) ... [2019-12-27 04:44:08,866 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2019-12-27 04:44:08,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:44:08,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:44:08,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:44:08,883 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:44:08,909 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,909 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,910 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,910 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,911 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,911 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,911 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,912 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,912 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,912 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,912 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,913 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,913 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,913 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,914 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,914 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,914 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,914 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,915 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,915 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,915 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,916 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,916 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,917 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,917 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,917 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,917 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,918 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,921 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,922 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,922 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,922 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,923 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,923 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,932 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,933 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,933 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,933 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,934 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,934 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:44:08,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 04:44:08,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:44:08,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:44:08,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:44:08,970 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:44:08,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:44:08,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:44:08,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:44:08,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:44:08,984 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 04:44:08,986 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 04:44:09,028 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 04:44:09,028 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:44:09,034 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 04:44:09,037 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 04:44:09,055 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 04:44:09,056 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:44:09,057 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 04:44:09,059 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 04:44:09,060 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:44:10,132 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 04:44:10,256 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 04:44:10,256 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 04:44:10,260 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 04:44:10,271 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 04:44:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 04:44:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:44:10,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:10,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:44:10,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 04:44:10,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:10,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863361197] [2019-12-27 04:44:10,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:10,524 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-27 04:44:10,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863361197] [2019-12-27 04:44:10,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:10,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:44:10,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535620771] [2019-12-27 04:44:10,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:44:10,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:44:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:44:10,554 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 04:44:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:10,598 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 04:44:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:44:10,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:44:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:10,617 INFO L225 Difference]: With dead ends: 48 [2019-12-27 04:44:10,617 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:10,619 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-27 04:44:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 04:44:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 04:44:10,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 04:44:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:10,653 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 04:44:10,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:44:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 04:44:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:44:10,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:10,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:10,654 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 04:44:10,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:10,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582962106] [2019-12-27 04:44:10,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:10,751 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-27 04:44:10,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582962106] [2019-12-27 04:44:10,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:10,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:44:10,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678756202] [2019-12-27 04:44:10,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:44:10,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:44:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:44:10,756 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 04:44:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:10,779 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:44:10,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 04:44:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:10,780 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:10,781 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 04:44:10,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:44:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 04:44:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 04:44:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:10,788 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 04:44:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:10,788 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:10,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:44:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:44:10,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:10,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:10,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 04:44:10,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:10,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157337180] [2019-12-27 04:44:10,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:10,860 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-27 04:44:10,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157337180] [2019-12-27 04:44:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:10,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:44:10,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087480844] [2019-12-27 04:44:10,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:44:10,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:44:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:44:10,862 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 04:44:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:10,904 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:44:10,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:44:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:10,907 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:10,907 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:10,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:44:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 04:44:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 04:44:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 04:44:10,912 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 04:44:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:10,913 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 04:44:10,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:44:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 04:44:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:44:10,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:10,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:10,914 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 04:44:10,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:10,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600210346] [2019-12-27 04:44:10,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:11,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-27 04:44:11,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600210346] [2019-12-27 04:44:11,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:44:11,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:44:11,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633313864] [2019-12-27 04:44:11,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:44:11,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:44:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:44:11,007 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 04:44:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:11,063 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 04:44:11,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:44:11,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:44:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:11,066 INFO L225 Difference]: With dead ends: 32 [2019-12-27 04:44:11,066 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 04:44:11,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:44:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 04:44:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 04:44:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 04:44:11,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 04:44:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:11,075 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 04:44:11,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:44:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 04:44:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:44:11,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:11,078 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:11,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 04:44:11,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:11,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561713295] [2019-12-27 04:44:11,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:11,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561713295] [2019-12-27 04:44:11,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720706426] [2019-12-27 04:44:11,196 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:11,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:44:11,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:11,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:44:11,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:11,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:11,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 04:44:11,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186434062] [2019-12-27 04:44:11,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:44:11,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:44:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:44:11,309 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-27 04:44:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:11,375 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 04:44:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:44:11,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 04:44:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:11,376 INFO L225 Difference]: With dead ends: 32 [2019-12-27 04:44:11,376 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 04:44:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 04:44:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 04:44:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 04:44:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 04:44:11,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 04:44:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:11,382 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 04:44:11,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:44:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 04:44:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:44:11,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:11,383 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:11,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:11,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 04:44:11,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:11,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593859951] [2019-12-27 04:44:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:11,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593859951] [2019-12-27 04:44:11,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996901738] [2019-12-27 04:44:11,664 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:11,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:11,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:11,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:44:11,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:11,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:11,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 04:44:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289755152] [2019-12-27 04:44:11,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:44:11,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:44:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:44:11,747 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-27 04:44:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:11,826 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 04:44:11,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:44:11,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 04:44:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:11,828 INFO L225 Difference]: With dead ends: 33 [2019-12-27 04:44:11,829 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 04:44:11,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 04:44:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 04:44:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:11,838 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 04:44:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:11,839 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:11,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:44:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:44:11,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:11,840 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:12,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:12,042 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 04:44:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:12,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489783237] [2019-12-27 04:44:12,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:12,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489783237] [2019-12-27 04:44:12,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539634519] [2019-12-27 04:44:12,121 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:12,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:12,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:12,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 04:44:12,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:12,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:12,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 04:44:12,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773553799] [2019-12-27 04:44:12,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:44:12,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:44:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:44:12,216 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-27 04:44:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:12,338 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 04:44:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:12,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 04:44:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:12,339 INFO L225 Difference]: With dead ends: 34 [2019-12-27 04:44:12,339 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 04:44:12,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 04:44:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 04:44:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 04:44:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 04:44:12,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 04:44:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:12,348 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 04:44:12,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:44:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 04:44:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:44:12,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:12,349 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:12,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:12,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 04:44:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:12,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942318275] [2019-12-27 04:44:12,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:12,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942318275] [2019-12-27 04:44:12,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275036029] [2019-12-27 04:44:12,620 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:12,675 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 04:44:12,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:12,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 04:44:12,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:12,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:12,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 04:44:12,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555702290] [2019-12-27 04:44:12,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:44:12,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:44:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:44:12,712 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-27 04:44:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:12,801 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 04:44:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:12,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-27 04:44:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:12,802 INFO L225 Difference]: With dead ends: 35 [2019-12-27 04:44:12,803 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 04:44:12,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 04:44:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 04:44:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 04:44:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 04:44:12,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 04:44:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:12,809 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 04:44:12,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:44:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 04:44:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:44:12,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:12,810 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:13,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:13,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 04:44:13,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:13,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951179820] [2019-12-27 04:44:13,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951179820] [2019-12-27 04:44:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572282430] [2019-12-27 04:44:13,072 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:13,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:44:13,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:13,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:13,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 04:44:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763431121] [2019-12-27 04:44:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:44:13,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:44:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:13,151 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-27 04:44:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:13,238 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 04:44:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:44:13,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 04:44:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:13,240 INFO L225 Difference]: With dead ends: 36 [2019-12-27 04:44:13,240 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 04:44:13,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 04:44:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 04:44:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 04:44:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 04:44:13,244 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 04:44:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:13,244 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 04:44:13,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:44:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 04:44:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:44:13,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:13,245 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:13,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:13,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 04:44:13,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:13,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112558161] [2019-12-27 04:44:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112558161] [2019-12-27 04:44:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33818642] [2019-12-27 04:44:13,511 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:13,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:13,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:13,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:44:13,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:13,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:13,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 04:44:13,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159901966] [2019-12-27 04:44:13,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:44:13,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:44:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:44:13,586 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-27 04:44:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:13,701 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 04:44:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:44:13,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-27 04:44:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:13,703 INFO L225 Difference]: With dead ends: 37 [2019-12-27 04:44:13,703 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 04:44:13,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 04:44:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 04:44:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 04:44:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 04:44:13,707 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 04:44:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:13,708 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 04:44:13,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:44:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 04:44:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:44:13,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:13,709 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:13,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:13,912 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 04:44:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272424525] [2019-12-27 04:44:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:14,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272424525] [2019-12-27 04:44:14,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40173226] [2019-12-27 04:44:14,020 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:14,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:44:14,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:14,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 04:44:14,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:14,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 04:44:14,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447972408] [2019-12-27 04:44:14,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:44:14,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:44:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:14,096 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-27 04:44:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:14,233 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 04:44:14,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:44:14,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 04:44:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:14,236 INFO L225 Difference]: With dead ends: 38 [2019-12-27 04:44:14,236 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 04:44:14,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 04:44:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 04:44:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 04:44:14,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 04:44:14,243 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 04:44:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:14,243 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 04:44:14,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:44:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 04:44:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:44:14,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:14,244 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:14,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:14,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 04:44:14,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:14,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608814345] [2019-12-27 04:44:14,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:14,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608814345] [2019-12-27 04:44:14,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323451973] [2019-12-27 04:44:14,534 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:14,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:14,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:14,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:44:14,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:14,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:14,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 04:44:14,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324496295] [2019-12-27 04:44:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:44:14,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:44:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:44:14,613 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-27 04:44:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:14,748 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 04:44:14,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:44:14,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-27 04:44:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:14,750 INFO L225 Difference]: With dead ends: 39 [2019-12-27 04:44:14,750 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 04:44:14,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 04:44:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 04:44:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 04:44:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 04:44:14,754 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 04:44:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:14,755 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 04:44:14,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:44:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 04:44:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:44:14,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:14,756 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:14,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:14,959 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 04:44:14,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:14,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091347063] [2019-12-27 04:44:14,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:15,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091347063] [2019-12-27 04:44:15,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455997131] [2019-12-27 04:44:15,032 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:15,077 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 04:44:15,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:15,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 04:44:15,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:15,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:15,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 04:44:15,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259860969] [2019-12-27 04:44:15,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:44:15,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:15,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:44:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:44:15,098 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-27 04:44:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:15,219 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 04:44:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:44:15,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:44:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:15,221 INFO L225 Difference]: With dead ends: 40 [2019-12-27 04:44:15,221 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 04:44:15,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 04:44:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 04:44:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 04:44:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 04:44:15,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 04:44:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:15,226 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 04:44:15,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:44:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 04:44:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:44:15,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:15,227 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:15,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:15,431 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 04:44:15,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:15,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68383482] [2019-12-27 04:44:15,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:15,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68383482] [2019-12-27 04:44:15,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525880761] [2019-12-27 04:44:15,528 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:15,611 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 04:44:15,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:15,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 04:44:15,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:15,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:15,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 04:44:15,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100099506] [2019-12-27 04:44:15,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:44:15,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:44:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:44:15,661 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-27 04:44:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:15,835 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 04:44:15,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:44:15,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:44:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:15,836 INFO L225 Difference]: With dead ends: 41 [2019-12-27 04:44:15,837 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 04:44:15,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 04:44:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 04:44:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 04:44:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 04:44:15,841 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 04:44:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:15,841 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 04:44:15,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:44:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 04:44:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:44:15,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:15,842 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:16,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:16,051 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 04:44:16,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:16,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103874383] [2019-12-27 04:44:16,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:16,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103874383] [2019-12-27 04:44:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225966670] [2019-12-27 04:44:16,295 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:16,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:44:16,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:16,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:16,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 04:44:16,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183796899] [2019-12-27 04:44:16,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:44:16,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:16,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:44:16,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:16,407 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-27 04:44:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:16,584 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 04:44:16,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:16,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:44:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:16,585 INFO L225 Difference]: With dead ends: 42 [2019-12-27 04:44:16,585 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 04:44:16,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 04:44:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 04:44:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 04:44:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 04:44:16,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 04:44:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:16,588 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 04:44:16,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:44:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 04:44:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:44:16,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:16,589 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:16,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:16,795 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 04:44:16,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:16,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663262101] [2019-12-27 04:44:16,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:16,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663262101] [2019-12-27 04:44:16,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606984725] [2019-12-27 04:44:16,899 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:16,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:16,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:16,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:44:16,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:17,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:17,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 04:44:17,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082526868] [2019-12-27 04:44:17,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:44:17,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:44:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:44:17,008 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-27 04:44:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:17,181 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 04:44:17,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:17,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:44:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:17,183 INFO L225 Difference]: With dead ends: 43 [2019-12-27 04:44:17,183 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 04:44:17,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 04:44:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 04:44:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 04:44:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 04:44:17,190 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 04:44:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:17,190 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 04:44:17,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:44:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 04:44:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:44:17,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:17,196 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:17,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:17,397 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 04:44:17,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:17,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724651102] [2019-12-27 04:44:17,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724651102] [2019-12-27 04:44:17,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131618370] [2019-12-27 04:44:17,533 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:17,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 04:44:17,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:17,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 04:44:17,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:17,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:17,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 04:44:17,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524237578] [2019-12-27 04:44:17,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:44:17,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:44:17,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:17,618 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-27 04:44:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:17,811 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 04:44:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:44:17,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 04:44:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:17,812 INFO L225 Difference]: With dead ends: 44 [2019-12-27 04:44:17,812 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 04:44:17,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 04:44:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 04:44:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 04:44:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 04:44:17,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 04:44:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 04:44:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:44:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 04:44:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:44:17,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:17,817 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:18,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:18,021 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 04:44:18,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:18,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229975061] [2019-12-27 04:44:18,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229975061] [2019-12-27 04:44:18,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897502469] [2019-12-27 04:44:18,110 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:18,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:18,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:18,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 04:44:18,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:18,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 04:44:18,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352101634] [2019-12-27 04:44:18,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:44:18,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:44:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:44:18,185 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-27 04:44:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:18,389 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 04:44:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 04:44:18,389 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 04:44:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:18,390 INFO L225 Difference]: With dead ends: 45 [2019-12-27 04:44:18,390 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 04:44:18,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 04:44:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 04:44:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 04:44:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 04:44:18,394 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 04:44:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:18,394 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 04:44:18,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:44:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 04:44:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:44:18,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:18,395 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:18,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:18,596 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 04:44:18,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:18,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497050574] [2019-12-27 04:44:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497050574] [2019-12-27 04:44:18,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364221641] [2019-12-27 04:44:18,713 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:18,771 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 04:44:18,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:18,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 04:44:18,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:18,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:18,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 04:44:18,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105140239] [2019-12-27 04:44:18,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:44:18,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:18,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:44:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:18,794 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 14 states. [2019-12-27 04:44:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,046 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-27 04:44:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:19,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 04:44:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,047 INFO L225 Difference]: With dead ends: 46 [2019-12-27 04:44:19,048 INFO L226 Difference]: Without dead ends: 43 [2019-12-27 04:44:19,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-27 04:44:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-27 04:44:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-27 04:44:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-27 04:44:19,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-27 04:44:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-27 04:44:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:44:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-27 04:44:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:44:19,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,053 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,262 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-27 04:44:19,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544927292] [2019-12-27 04:44:19,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544927292] [2019-12-27 04:44:19,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952850237] [2019-12-27 04:44:19,377 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,428 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 04:44:19,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:19,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 04:44:19,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:19,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 04:44:19,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26710772] [2019-12-27 04:44:19,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:44:19,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:44:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:44:19,463 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 14 states. [2019-12-27 04:44:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:19,678 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-27 04:44:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:19,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 04:44:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:19,680 INFO L225 Difference]: With dead ends: 47 [2019-12-27 04:44:19,680 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 04:44:19,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:44:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 04:44:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 04:44:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 04:44:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 04:44:19,684 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-27 04:44:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:19,684 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 04:44:19,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:44:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 04:44:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:44:19,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:19,685 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:19,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:19,888 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-27 04:44:19,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:19,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300401391] [2019-12-27 04:44:19,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:19,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300401391] [2019-12-27 04:44:19,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354099636] [2019-12-27 04:44:19,990 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:20,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 04:44:20,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:20,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 04:44:20,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102106522] [2019-12-27 04:44:20,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:44:20,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:20,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:44:20,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:20,072 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 15 states. [2019-12-27 04:44:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:20,292 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-27 04:44:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:44:20,293 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:44:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:20,294 INFO L225 Difference]: With dead ends: 48 [2019-12-27 04:44:20,294 INFO L226 Difference]: Without dead ends: 45 [2019-12-27 04:44:20,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:44:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-27 04:44:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-27 04:44:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 04:44:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 04:44:20,298 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-27 04:44:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:20,298 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 04:44:20,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:44:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 04:44:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:44:20,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:20,299 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:20,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,502 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-27 04:44:20,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:20,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658062999] [2019-12-27 04:44:20,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658062999] [2019-12-27 04:44:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475771582] [2019-12-27 04:44:20,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:20,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:20,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:20,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 04:44:20,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:20,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:20,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 04:44:20,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417589621] [2019-12-27 04:44:20,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:44:20,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:44:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:44:20,721 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 15 states. [2019-12-27 04:44:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:20,970 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-27 04:44:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:44:20,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:44:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:20,971 INFO L225 Difference]: With dead ends: 49 [2019-12-27 04:44:20,971 INFO L226 Difference]: Without dead ends: 46 [2019-12-27 04:44:20,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:44:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-27 04:44:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-27 04:44:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 04:44:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 04:44:20,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-27 04:44:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:20,975 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 04:44:20,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:44:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 04:44:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:44:20,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:20,976 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:21,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,179 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-27 04:44:21,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:21,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540027735] [2019-12-27 04:44:21,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540027735] [2019-12-27 04:44:21,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997726054] [2019-12-27 04:44:21,344 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 04:44:21,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:21,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 04:44:21,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:21,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:21,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 04:44:21,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610681105] [2019-12-27 04:44:21,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:44:21,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:44:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:21,423 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 16 states. [2019-12-27 04:44:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:21,690 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-27 04:44:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:44:21,691 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-27 04:44:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:21,691 INFO L225 Difference]: With dead ends: 50 [2019-12-27 04:44:21,692 INFO L226 Difference]: Without dead ends: 47 [2019-12-27 04:44:21,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:44:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-27 04:44:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-27 04:44:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 04:44:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-27 04:44:21,695 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-27 04:44:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:21,695 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-27 04:44:21,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:44:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-27 04:44:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:44:21,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:21,696 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:21,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:21,897 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-27 04:44:21,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:21,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696225987] [2019-12-27 04:44:21,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696225987] [2019-12-27 04:44:22,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955568005] [2019-12-27 04:44:22,006 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:22,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:22,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 04:44:22,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:22,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 04:44:22,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481280178] [2019-12-27 04:44:22,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:44:22,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:22,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:44:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:44:22,087 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 16 states. [2019-12-27 04:44:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:22,359 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-27 04:44:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:44:22,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-27 04:44:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:22,360 INFO L225 Difference]: With dead ends: 51 [2019-12-27 04:44:22,360 INFO L226 Difference]: Without dead ends: 48 [2019-12-27 04:44:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:44:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-27 04:44:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-27 04:44:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 04:44:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 04:44:22,363 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-27 04:44:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:22,363 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 04:44:22,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:44:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 04:44:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:44:22,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:22,364 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:22,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,567 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-27 04:44:22,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:22,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877467434] [2019-12-27 04:44:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877467434] [2019-12-27 04:44:22,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560424158] [2019-12-27 04:44:22,687 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:22,735 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 04:44:22,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:22,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 04:44:22,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:22,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:22,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 04:44:22,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640010371] [2019-12-27 04:44:22,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:44:22,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:44:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:22,769 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 17 states. [2019-12-27 04:44:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:23,053 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-27 04:44:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:44:23,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-27 04:44:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:23,054 INFO L225 Difference]: With dead ends: 52 [2019-12-27 04:44:23,054 INFO L226 Difference]: Without dead ends: 49 [2019-12-27 04:44:23,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:44:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-27 04:44:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-27 04:44:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 04:44:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 04:44:23,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-27 04:44:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:23,058 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 04:44:23,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:44:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 04:44:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:44:23,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:23,059 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:23,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,260 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:23,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-27 04:44:23,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:23,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278404664] [2019-12-27 04:44:23,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278404664] [2019-12-27 04:44:23,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848064940] [2019-12-27 04:44:23,371 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,429 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 04:44:23,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:23,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 04:44:23,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:23,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:23,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 04:44:23,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449839605] [2019-12-27 04:44:23,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 04:44:23,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 04:44:23,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:44:23,450 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 17 states. [2019-12-27 04:44:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:23,753 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-27 04:44:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:44:23,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-27 04:44:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:23,755 INFO L225 Difference]: With dead ends: 53 [2019-12-27 04:44:23,755 INFO L226 Difference]: Without dead ends: 50 [2019-12-27 04:44:23,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=580, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:44:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-27 04:44:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-27 04:44:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 04:44:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 04:44:23,759 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-27 04:44:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:23,759 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 04:44:23,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 04:44:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 04:44:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:44:23,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:23,760 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:23,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:23,964 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-27 04:44:23,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:23,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770344303] [2019-12-27 04:44:23,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770344303] [2019-12-27 04:44:24,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018081507] [2019-12-27 04:44:24,087 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 04:44:24,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:24,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 04:44:24,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797326450] [2019-12-27 04:44:24,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:44:24,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:44:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:24,155 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 18 states. [2019-12-27 04:44:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:24,478 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-27 04:44:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:24,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-27 04:44:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:24,479 INFO L225 Difference]: With dead ends: 54 [2019-12-27 04:44:24,479 INFO L226 Difference]: Without dead ends: 51 [2019-12-27 04:44:24,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=662, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:44:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-27 04:44:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-27 04:44:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-27 04:44:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-27 04:44:24,482 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-27 04:44:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-27 04:44:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:44:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-27 04:44:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:44:24,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:24,483 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:24,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,688 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-27 04:44:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:24,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769503288] [2019-12-27 04:44:24,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769503288] [2019-12-27 04:44:24,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450689411] [2019-12-27 04:44:24,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:24,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:24,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:24,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 04:44:24,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:24,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:24,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 04:44:24,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485379089] [2019-12-27 04:44:24,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:44:24,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:44:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:44:24,914 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 18 states. [2019-12-27 04:44:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:25,227 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-27 04:44:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:25,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-27 04:44:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:25,228 INFO L225 Difference]: With dead ends: 55 [2019-12-27 04:44:25,228 INFO L226 Difference]: Without dead ends: 52 [2019-12-27 04:44:25,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:44:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-27 04:44:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-27 04:44:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 04:44:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 04:44:25,232 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-27 04:44:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:25,232 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 04:44:25,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:44:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 04:44:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:44:25,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:25,233 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:25,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:25,437 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-27 04:44:25,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:25,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380578576] [2019-12-27 04:44:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:25,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380578576] [2019-12-27 04:44:25,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700054994] [2019-12-27 04:44:25,591 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:25,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 04:44:25,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:25,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 04:44:25,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:25,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:25,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 04:44:25,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003352904] [2019-12-27 04:44:25,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:44:25,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:25,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:44:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:44:25,721 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 19 states. [2019-12-27 04:44:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:26,097 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-27 04:44:26,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:44:26,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 04:44:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:26,098 INFO L225 Difference]: With dead ends: 56 [2019-12-27 04:44:26,098 INFO L226 Difference]: Without dead ends: 53 [2019-12-27 04:44:26,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:44:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-27 04:44:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-27 04:44:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 04:44:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 04:44:26,103 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-27 04:44:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:26,104 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 04:44:26,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:44:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 04:44:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:44:26,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:26,104 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:26,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:26,309 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-27 04:44:26,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:26,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372990591] [2019-12-27 04:44:26,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:26,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372990591] [2019-12-27 04:44:26,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697562306] [2019-12-27 04:44:26,468 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:26,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:26,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:26,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 04:44:26,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:26,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:26,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 04:44:26,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117531906] [2019-12-27 04:44:26,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:44:26,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:26,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:44:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:44:26,545 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 19 states. [2019-12-27 04:44:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:26,922 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-27 04:44:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:44:26,922 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-27 04:44:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:26,923 INFO L225 Difference]: With dead ends: 57 [2019-12-27 04:44:26,923 INFO L226 Difference]: Without dead ends: 54 [2019-12-27 04:44:26,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=751, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:44:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-27 04:44:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-27 04:44:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 04:44:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 04:44:26,926 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-27 04:44:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:26,927 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 04:44:26,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:44:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 04:44:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:44:26,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:26,927 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:27,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,131 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-27 04:44:27,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:27,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452196020] [2019-12-27 04:44:27,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452196020] [2019-12-27 04:44:27,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892099275] [2019-12-27 04:44:27,284 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,336 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-27 04:44:27,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:27,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 04:44:27,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:27,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:27,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 04:44:27,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972676083] [2019-12-27 04:44:27,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:44:27,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:27,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:44:27,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:27,366 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 20 states. [2019-12-27 04:44:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:27,763 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-27 04:44:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:27,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-27 04:44:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:27,764 INFO L225 Difference]: With dead ends: 58 [2019-12-27 04:44:27,764 INFO L226 Difference]: Without dead ends: 55 [2019-12-27 04:44:27,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=844, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:44:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-27 04:44:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-27 04:44:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 04:44:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-27 04:44:27,768 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-27 04:44:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:27,768 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-27 04:44:27,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:44:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-27 04:44:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:44:27,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:27,769 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:27,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:27,973 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:27,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-27 04:44:27,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736803892] [2019-12-27 04:44:27,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:28,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736803892] [2019-12-27 04:44:28,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952884809] [2019-12-27 04:44:28,116 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:28,175 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 04:44:28,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:28,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 04:44:28,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:28,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:28,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 04:44:28,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393920281] [2019-12-27 04:44:28,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:44:28,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:28,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:44:28,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:44:28,199 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 20 states. [2019-12-27 04:44:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:28,651 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-27 04:44:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:28,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-27 04:44:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:28,653 INFO L225 Difference]: With dead ends: 59 [2019-12-27 04:44:28,653 INFO L226 Difference]: Without dead ends: 56 [2019-12-27 04:44:28,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:44:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-27 04:44:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-27 04:44:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 04:44:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 04:44:28,656 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-27 04:44:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:28,657 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 04:44:28,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:44:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 04:44:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:44:28,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:28,657 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:28,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:28,858 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:28,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-27 04:44:28,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:28,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43466670] [2019-12-27 04:44:28,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43466670] [2019-12-27 04:44:29,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717310115] [2019-12-27 04:44:29,017 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:29,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 04:44:29,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:29,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 04:44:29,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303606272] [2019-12-27 04:44:29,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:44:29,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:44:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:29,099 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 21 states. [2019-12-27 04:44:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:29,503 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-27 04:44:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:44:29,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-27 04:44:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:29,504 INFO L225 Difference]: With dead ends: 60 [2019-12-27 04:44:29,505 INFO L226 Difference]: Without dead ends: 57 [2019-12-27 04:44:29,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=442, Invalid=890, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:44:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-27 04:44:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-27 04:44:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 04:44:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 04:44:29,508 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-27 04:44:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:29,509 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 04:44:29,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:44:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 04:44:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:44:29,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:29,509 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:29,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,713 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-27 04:44:29,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:29,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073764521] [2019-12-27 04:44:29,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073764521] [2019-12-27 04:44:29,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300027958] [2019-12-27 04:44:29,903 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:29,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:44:29,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:29,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 04:44:29,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:29,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 04:44:29,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055857988] [2019-12-27 04:44:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:44:29,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:44:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:44:29,983 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 21 states. [2019-12-27 04:44:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:30,398 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-27 04:44:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:44:30,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-27 04:44:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:30,404 INFO L225 Difference]: With dead ends: 61 [2019-12-27 04:44:30,404 INFO L226 Difference]: Without dead ends: 58 [2019-12-27 04:44:30,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=944, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:44:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-27 04:44:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-27 04:44:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 04:44:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 04:44:30,407 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-27 04:44:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:30,407 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 04:44:30,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:44:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 04:44:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:44:30,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:30,408 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:30,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:30,611 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-27 04:44:30,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:30,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529755565] [2019-12-27 04:44:30,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:30,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529755565] [2019-12-27 04:44:30,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280996946] [2019-12-27 04:44:30,843 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:30,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 04:44:30,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:30,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 04:44:30,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:30,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:30,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 04:44:30,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810754545] [2019-12-27 04:44:30,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 04:44:30,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:30,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 04:44:30,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:30,926 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 22 states. [2019-12-27 04:44:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:31,330 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-27 04:44:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:44:31,331 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 04:44:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:31,332 INFO L225 Difference]: With dead ends: 62 [2019-12-27 04:44:31,332 INFO L226 Difference]: Without dead ends: 59 [2019-12-27 04:44:31,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=445, Invalid=1037, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:44:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-27 04:44:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-27 04:44:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-27 04:44:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-27 04:44:31,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-27 04:44:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:31,334 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-27 04:44:31,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 04:44:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-27 04:44:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:44:31,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:31,335 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:31,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,539 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-27 04:44:31,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:31,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390756312] [2019-12-27 04:44:31,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390756312] [2019-12-27 04:44:31,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238609999] [2019-12-27 04:44:31,727 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:31,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:44:31,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:31,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 04:44:31,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:31,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:31,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 04:44:31,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768704919] [2019-12-27 04:44:31,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 04:44:31,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 04:44:31,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:44:31,816 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 22 states. [2019-12-27 04:44:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:32,265 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-27 04:44:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:44:32,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 04:44:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:32,266 INFO L225 Difference]: With dead ends: 63 [2019-12-27 04:44:32,266 INFO L226 Difference]: Without dead ends: 60 [2019-12-27 04:44:32,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=527, Invalid=1033, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:44:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-27 04:44:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-27 04:44:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-27 04:44:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-27 04:44:32,270 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-27 04:44:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:32,270 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-27 04:44:32,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 04:44:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-27 04:44:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:44:32,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:32,271 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:32,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:32,473 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-27 04:44:32,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:32,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843821502] [2019-12-27 04:44:32,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:32,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843821502] [2019-12-27 04:44:32,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900287013] [2019-12-27 04:44:32,670 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:32,724 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 04:44:32,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:32,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 04:44:32,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:32,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:32,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 04:44:32,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337876937] [2019-12-27 04:44:32,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:44:32,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:44:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:44:32,753 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 23 states. [2019-12-27 04:44:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:33,203 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-27 04:44:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:44:33,203 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-27 04:44:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:33,204 INFO L225 Difference]: With dead ends: 64 [2019-12-27 04:44:33,204 INFO L226 Difference]: Without dead ends: 61 [2019-12-27 04:44:33,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=541, Invalid=1099, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:44:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-27 04:44:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-27 04:44:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 04:44:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 04:44:33,207 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-27 04:44:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:33,207 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 04:44:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:44:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 04:44:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:44:33,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:33,208 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:33,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:33,409 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-27 04:44:33,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:33,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558324138] [2019-12-27 04:44:33,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:44:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:33,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558324138] [2019-12-27 04:44:33,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177542900] [2019-12-27 04:44:33,679 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:33,773 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-27 04:44:33,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:44:33,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 04:44:33,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:44:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:44:33,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:44:33,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 04:44:33,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166170127] [2019-12-27 04:44:33,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:44:33,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:44:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:44:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:44:33,822 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 23 states. [2019-12-27 04:44:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:44:34,297 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-27 04:44:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 04:44:34,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-27 04:44:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:44:34,299 INFO L225 Difference]: With dead ends: 65 [2019-12-27 04:44:34,299 INFO L226 Difference]: Without dead ends: 62 [2019-12-27 04:44:34,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=1159, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:44:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-27 04:44:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-27 04:44:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 04:44:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-27 04:44:34,302 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-27 04:44:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:44:34,302 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-27 04:44:34,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:44:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-27 04:44:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:44:34,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:44:34,303 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:44:34,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:44:34,507 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:44:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:44:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-27 04:44:34,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:44:34,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801339919] [2019-12-27 04:44:34,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:44:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:44:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:44:34,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:44:34,557 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:44:34,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~j~0_16 6) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= v_~i~0_16 3) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_16, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_10|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_14, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_14, ~i~0=v_~i~0_16, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 04:44:34,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-27 04:44:34,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_4 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_10 0) (= v_t1Thread1of1ForFork1_~arg.base_4 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_4, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_4, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= v_t2Thread1of1ForFork0_~arg.offset_4 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_10) (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_4)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_4, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_4, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 04:44:34,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 04:44:34,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (= v_ULTIMATE.start_main_~condJ~0_11 0)) (.cse1 (= v_ULTIMATE.start_main_~condI~0_11 0))) (and (let ((.cse0 (<= 26 v_~i~0_12))) (or (and (= v_ULTIMATE.start_main_~condI~0_11 1) .cse0) (and .cse1 (not .cse0)))) (let ((.cse2 (<= 26 v_~j~0_12))) (or (and .cse2 (= v_ULTIMATE.start_main_~condJ~0_11 1)) (and (not .cse2) .cse3))) (or (not .cse3) (not .cse1)))) InVars {~j~0=v_~j~0_12, ~i~0=v_~i~0_12} OutVars{~j~0=v_~j~0_12, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_11, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_11, ~i~0=v_~i~0_12, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-27 04:44:34,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:44:34 BasicIcfg [2019-12-27 04:44:34,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:44:34,585 INFO L168 Benchmark]: Toolchain (without parser) took 26901.93 ms. Allocated memory was 145.8 MB in the beginning and 374.9 MB in the end (delta: 229.1 MB). Free memory was 102.5 MB in the beginning and 218.8 MB in the end (delta: -116.3 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,585 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.22 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 160.6 MB in the end (delta: -58.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.89 ms. Allocated memory is still 203.4 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,586 INFO L168 Benchmark]: Boogie Preprocessor took 26.24 ms. Allocated memory is still 203.4 MB. Free memory was 158.6 MB in the beginning and 157.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,587 INFO L168 Benchmark]: RCFGBuilder took 419.93 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 137.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,587 INFO L168 Benchmark]: TraceAbstraction took 25723.96 ms. Allocated memory was 203.4 MB in the beginning and 374.9 MB in the end (delta: 171.4 MB). Free memory was 137.5 MB in the beginning and 218.8 MB in the end (delta: -81.3 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-12-27 04:44:34,589 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.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 679.22 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 160.6 MB in the end (delta: -58.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.89 ms. Allocated memory is still 203.4 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.24 ms. Allocated memory is still 203.4 MB. Free memory was 158.6 MB in the beginning and 157.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 419.93 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 137.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25723.96 ms. Allocated memory was 203.4 MB in the beginning and 374.9 MB in the end (delta: 171.4 MB). Free memory was 137.5 MB in the beginning and 218.8 MB in the end (delta: -81.3 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 25.5s, OverallIterations: 39, TraceHistogramMax: 10, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 1171 SDslu, 1086 SDs, 0 SdLazy, 1465 SolverSat, 1392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1360 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 816 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 261 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 70324 SizeOfPredicates, 340 NumberOfNonLiveVariables, 4046 ConjunctsInSsa, 514 ConjunctsInUnsatCore, 72 InterpolantComputations, 4 PerfectInterpolantSequences, 0/2100 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...