/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 11:46:48,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 11:46:48,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 11:46:48,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 11:46:48,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 11:46:48,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 11:46:48,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 11:46:48,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 11:46:48,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 11:46:48,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 11:46:48,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 11:46:48,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 11:46:48,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 11:46:48,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 11:46:48,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 11:46:48,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 11:46:48,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 11:46:48,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 11:46:48,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 11:46:48,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 11:46:48,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 11:46:48,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 11:46:48,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 11:46:48,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 11:46:48,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 11:46:48,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 11:46:48,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 11:46:48,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 11:46:48,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 11:46:48,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 11:46:48,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 11:46:48,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 11:46:48,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 11:46:48,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 11:46:48,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 11:46:48,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 11:46:48,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 11:46:48,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 11:46:48,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 11:46:48,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 11:46:48,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 11:46:48,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 11:46:48,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 11:46:48,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 11:46:48,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 11:46:48,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 11:46:48,222 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 11:46:48,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 11:46:48,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 11:46:48,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 11:46:48,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 11:46:48,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 11:46:48,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 11:46:48,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 11:46:48,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 11:46:48,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 11:46:48,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 11:46:48,226 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 11:46:48,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 11:46:48,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 11:46:48,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 11:46:48,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 11:46:48,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 11:46:48,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 11:46:48,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 11:46:48,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 11:46:48,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 11:46:48,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 11:46:48,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 11:46:48,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 11:46:48,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 11:46:48,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 11:46:48,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 11:46:48,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 11:46:48,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 11:46:48,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 11:46:48,524 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 11:46:48,525 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2019-12-18 11:46:48,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ff6b4a3/ee7c1ccfaf8644f2b2b93b9e133c6298/FLAGde1d09096 [2019-12-18 11:46:49,185 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 11:46:49,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2019-12-18 11:46:49,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ff6b4a3/ee7c1ccfaf8644f2b2b93b9e133c6298/FLAGde1d09096 [2019-12-18 11:46:49,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ff6b4a3/ee7c1ccfaf8644f2b2b93b9e133c6298 [2019-12-18 11:46:49,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 11:46:49,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 11:46:49,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 11:46:49,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 11:46:49,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 11:46:49,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:46:49" (1/1) ... [2019-12-18 11:46:49,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699bc956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:49, skipping insertion in model container [2019-12-18 11:46:49,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:46:49" (1/1) ... [2019-12-18 11:46:49,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 11:46:49,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 11:46:49,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:46:49,970 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 11:46:50,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:46:50,117 INFO L208 MainTranslator]: Completed translation [2019-12-18 11:46:50,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50 WrapperNode [2019-12-18 11:46:50,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 11:46:50,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 11:46:50,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 11:46:50,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 11:46:50,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 11:46:50,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 11:46:50,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 11:46:50,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 11:46:50,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... [2019-12-18 11:46:50,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 11:46:50,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 11:46:50,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 11:46:50,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 11:46:50,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 11:46:50,281 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 11:46:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 11:46:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 11:46:50,282 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 11:46:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 11:46:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 11:46:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 11:46:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 11:46:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 11:46:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 11:46:50,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 11:46:50,285 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 11:46:50,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 11:46:50,639 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 11:46:50,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:46:50 BoogieIcfgContainer [2019-12-18 11:46:50,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 11:46:50,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 11:46:50,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 11:46:50,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 11:46:50,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:46:49" (1/3) ... [2019-12-18 11:46:50,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323ebd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:46:50, skipping insertion in model container [2019-12-18 11:46:50,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:46:50" (2/3) ... [2019-12-18 11:46:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323ebd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:46:50, skipping insertion in model container [2019-12-18 11:46:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:46:50" (3/3) ... [2019-12-18 11:46:50,655 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-12-18 11:46:50,663 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 11:46:50,663 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 11:46:50,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 11:46:50,669 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 11:46:50,697 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,697 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,697 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,698 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,698 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,698 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,699 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,699 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,700 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,700 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,701 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,701 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,701 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,701 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,702 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,702 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,702 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,702 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,703 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,703 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,703 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,703 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,704 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,704 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,708 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,708 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,708 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,709 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,709 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,709 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,714 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,715 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,715 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,715 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,716 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,716 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:46:50,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-18 11:46:50,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:46:50,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:46:50,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:46:50,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:46:50,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:46:50,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:46:50,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:46:50,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:46:50,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-18 11:46:50,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 11:46:50,813 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 11:46:50,814 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:46:50,823 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. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-18 11:46:50,829 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 11:46:50,846 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 11:46:50,846 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:46:50,848 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. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-18 11:46:50,850 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-18 11:46:50,851 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:46:51,980 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 11:46:52,109 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-18 11:46:52,110 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-18 11:46:52,113 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-18 11:46:52,121 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-18 11:46:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-18 11:46:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:46:52,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:52,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:46:52,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-18 11:46:52,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:52,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732655370] [2019-12-18 11:46:52,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:52,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732655370] [2019-12-18 11:46:52,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:52,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 11:46:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621303987] [2019-12-18 11:46:52,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:46:52,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:46:52,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:46:52,458 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-18 11:46:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:52,506 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-18 11:46:52,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:46:52,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:46:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:52,536 INFO L225 Difference]: With dead ends: 48 [2019-12-18 11:46:52,536 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 11:46:52,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:46:52,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 11:46:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 11:46:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 11:46:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-18 11:46:52,583 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-18 11:46:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:52,584 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-18 11:46:52,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:46:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-18 11:46:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 11:46:52,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:52,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:52,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-18 11:46:52,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:52,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383579668] [2019-12-18 11:46:52,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:52,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383579668] [2019-12-18 11:46:52,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:52,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:46:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773677545] [2019-12-18 11:46:52,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:46:52,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:46:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:46:52,711 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-18 11:46:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:52,740 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 11:46:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:46:52,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 11:46:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:52,742 INFO L225 Difference]: With dead ends: 34 [2019-12-18 11:46:52,742 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 11:46:52,743 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-18 11:46:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 11:46:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 11:46:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 11:46:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 11:46:52,748 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-18 11:46:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:52,749 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 11:46:52,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:46:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 11:46:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:46:52,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:52,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:52,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-18 11:46:52,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:52,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430029320] [2019-12-18 11:46:52,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:52,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430029320] [2019-12-18 11:46:52,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:52,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:46:52,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348503945] [2019-12-18 11:46:52,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 11:46:52,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 11:46:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 11:46:52,819 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-18 11:46:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:52,857 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 11:46:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 11:46:52,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 11:46:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:52,861 INFO L225 Difference]: With dead ends: 34 [2019-12-18 11:46:52,861 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 11:46:52,861 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-18 11:46:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 11:46:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-18 11:46:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 11:46:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 11:46:52,866 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-18 11:46:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:52,866 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 11:46:52,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 11:46:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 11:46:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:46:52,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:52,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:52,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:52,868 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-18 11:46:52,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:52,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124195004] [2019-12-18 11:46:52,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:46:52,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124195004] [2019-12-18 11:46:52,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:46:52,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:46:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914959221] [2019-12-18 11:46:52,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 11:46:52,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 11:46:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 11:46:52,915 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-18 11:46:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:52,959 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 11:46:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 11:46:52,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 11:46:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:52,961 INFO L225 Difference]: With dead ends: 32 [2019-12-18 11:46:52,961 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 11:46:52,962 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-18 11:46:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 11:46:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 11:46:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 11:46:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 11:46:52,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-18 11:46:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:52,967 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 11:46:52,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 11:46:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 11:46:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 11:46:52,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:52,968 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:52,968 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-18 11:46:52,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:52,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686463049] [2019-12-18 11:46:52,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:53,026 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-18 11:46:53,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686463049] [2019-12-18 11:46:53,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081900809] [2019-12-18 11:46:53,027 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-18 11:46:53,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 11:46:53,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:53,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 11:46:53,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:53,132 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-18 11:46:53,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:53,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 11:46:53,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30022847] [2019-12-18 11:46:53,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 11:46:53,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 11:46:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 11:46:53,134 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-18 11:46:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:53,191 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 11:46:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 11:46:53,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 11:46:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:53,193 INFO L225 Difference]: With dead ends: 32 [2019-12-18 11:46:53,193 INFO L226 Difference]: Without dead ends: 29 [2019-12-18 11:46:53,193 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-18 11:46:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-18 11:46:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-18 11:46:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 11:46:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 11:46:53,197 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-18 11:46:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:53,198 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 11:46:53,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 11:46:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 11:46:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 11:46:53,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:53,199 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:53,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:53,400 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-18 11:46:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:53,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510170661] [2019-12-18 11:46:53,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:53,467 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-18 11:46:53,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510170661] [2019-12-18 11:46:53,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943138168] [2019-12-18 11:46:53,469 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-18 11:46:53,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:46:53,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:53,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 11:46:53,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:53,570 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-18 11:46:53,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:53,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 11:46:53,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683939622] [2019-12-18 11:46:53,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 11:46:53,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:53,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 11:46:53,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 11:46:53,573 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-18 11:46:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:53,664 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-18 11:46:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 11:46:53,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 11:46:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:53,665 INFO L225 Difference]: With dead ends: 33 [2019-12-18 11:46:53,665 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 11:46:53,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-18 11:46:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 11:46:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 11:46:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 11:46:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 11:46:53,671 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-18 11:46:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:53,672 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 11:46:53,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 11:46:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 11:46:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:46:53,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:53,673 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:53,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:53,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-18 11:46:53,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:53,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400128302] [2019-12-18 11:46:53,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:53,932 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-18 11:46:53,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400128302] [2019-12-18 11:46:53,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745033648] [2019-12-18 11:46:53,934 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-18 11:46:53,982 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:46:53,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:53,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 11:46:53,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:54,019 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-18 11:46:54,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:54,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 11:46:54,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540357198] [2019-12-18 11:46:54,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 11:46:54,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:54,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 11:46:54,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 11:46:54,021 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-18 11:46:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:54,104 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 11:46:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 11:46:54,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 11:46:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:54,105 INFO L225 Difference]: With dead ends: 34 [2019-12-18 11:46:54,105 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 11:46:54,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-18 11:46:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 11:46:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-18 11:46:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-18 11:46:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-18 11:46:54,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-18 11:46:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:54,110 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-18 11:46:54,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 11:46:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-18 11:46:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:46:54,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:54,111 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:54,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:54,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-18 11:46:54,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:54,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085766356] [2019-12-18 11:46:54,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:54,366 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-18 11:46:54,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085766356] [2019-12-18 11:46:54,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185518327] [2019-12-18 11:46:54,367 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-18 11:46:54,453 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 11:46:54,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:54,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 11:46:54,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:54,469 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-18 11:46:54,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:54,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 11:46:54,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787519384] [2019-12-18 11:46:54,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 11:46:54,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 11:46:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 11:46:54,471 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-18 11:46:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:54,546 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-18 11:46:54,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 11:46:54,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 11:46:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:54,547 INFO L225 Difference]: With dead ends: 35 [2019-12-18 11:46:54,547 INFO L226 Difference]: Without dead ends: 32 [2019-12-18 11:46:54,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-18 11:46:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-18 11:46:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-18 11:46:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-18 11:46:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-18 11:46:54,552 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-18 11:46:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:54,552 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-18 11:46:54,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 11:46:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-18 11:46:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:46:54,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:54,553 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:54,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:54,757 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-18 11:46:54,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:54,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617187413] [2019-12-18 11:46:54,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:54,836 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-18 11:46:54,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617187413] [2019-12-18 11:46:54,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666506511] [2019-12-18 11:46:54,837 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-18 11:46:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:54,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 11:46:54,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:54,915 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-18 11:46:54,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:54,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 11:46:54,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848627679] [2019-12-18 11:46:54,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 11:46:54,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 11:46:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 11:46:54,917 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-18 11:46:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:55,011 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-18 11:46:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 11:46:55,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 11:46:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:55,013 INFO L225 Difference]: With dead ends: 36 [2019-12-18 11:46:55,013 INFO L226 Difference]: Without dead ends: 33 [2019-12-18 11:46:55,013 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-18 11:46:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-18 11:46:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-18 11:46:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 11:46:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-18 11:46:55,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-18 11:46:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:55,021 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-18 11:46:55,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 11:46:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-18 11:46:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:46:55,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:55,022 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:55,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:55,223 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-18 11:46:55,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:55,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277228187] [2019-12-18 11:46:55,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:55,307 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-18 11:46:55,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277228187] [2019-12-18 11:46:55,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453880607] [2019-12-18 11:46:55,308 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-18 11:46:55,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:46:55,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:55,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 11:46:55,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:55,376 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-18 11:46:55,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:55,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 11:46:55,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305459971] [2019-12-18 11:46:55,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 11:46:55,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 11:46:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 11:46:55,378 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-18 11:46:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:55,491 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-18 11:46:55,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 11:46:55,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 11:46:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:55,492 INFO L225 Difference]: With dead ends: 37 [2019-12-18 11:46:55,492 INFO L226 Difference]: Without dead ends: 34 [2019-12-18 11:46:55,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-18 11:46:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-18 11:46:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-18 11:46:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-18 11:46:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-18 11:46:55,497 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-18 11:46:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:55,498 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-18 11:46:55,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 11:46:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-18 11:46:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 11:46:55,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:55,499 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:55,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:55,703 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-18 11:46:55,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:55,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910051261] [2019-12-18 11:46:55,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:55,772 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-18 11:46:55,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910051261] [2019-12-18 11:46:55,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284903100] [2019-12-18 11:46:55,773 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-18 11:46:55,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 11:46:55,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:55,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 11:46:55,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:55,847 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-18 11:46:55,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:55,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 11:46:55,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190041894] [2019-12-18 11:46:55,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 11:46:55,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 11:46:55,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 11:46:55,851 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-18 11:46:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:56,015 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-18 11:46:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 11:46:56,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 11:46:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:56,016 INFO L225 Difference]: With dead ends: 38 [2019-12-18 11:46:56,017 INFO L226 Difference]: Without dead ends: 35 [2019-12-18 11:46:56,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-18 11:46:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-18 11:46:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-18 11:46:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-18 11:46:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-18 11:46:56,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-18 11:46:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:56,021 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-18 11:46:56,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 11:46:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-18 11:46:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 11:46:56,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:56,022 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:56,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:56,225 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-18 11:46:56,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:56,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856241631] [2019-12-18 11:46:56,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:56,308 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-18 11:46:56,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856241631] [2019-12-18 11:46:56,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285653153] [2019-12-18 11:46:56,309 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-18 11:46:56,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:46:56,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:56,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 11:46:56,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:56,392 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-18 11:46:56,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:56,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 11:46:56,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568714227] [2019-12-18 11:46:56,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 11:46:56,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 11:46:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 11:46:56,394 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-18 11:46:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:56,532 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-18 11:46:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 11:46:56,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 11:46:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:56,533 INFO L225 Difference]: With dead ends: 39 [2019-12-18 11:46:56,533 INFO L226 Difference]: Without dead ends: 36 [2019-12-18 11:46:56,534 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-18 11:46:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-18 11:46:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-18 11:46:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-18 11:46:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-18 11:46:56,538 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-18 11:46:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:56,538 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-18 11:46:56,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 11:46:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-18 11:46:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 11:46:56,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:56,539 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:56,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:56,743 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-18 11:46:56,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:56,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698675708] [2019-12-18 11:46:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:56,826 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-18 11:46:56,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698675708] [2019-12-18 11:46:56,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853091580] [2019-12-18 11:46:56,827 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-18 11:46:56,883 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-18 11:46:56,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:56,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 11:46:56,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:56,908 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-18 11:46:56,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:56,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 11:46:56,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539774681] [2019-12-18 11:46:56,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 11:46:56,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:56,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 11:46:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 11:46:56,910 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-18 11:46:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:57,061 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-18 11:46:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 11:46:57,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 11:46:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:57,062 INFO L225 Difference]: With dead ends: 40 [2019-12-18 11:46:57,062 INFO L226 Difference]: Without dead ends: 37 [2019-12-18 11:46:57,062 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-18 11:46:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-18 11:46:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-18 11:46:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-18 11:46:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-18 11:46:57,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-18 11:46:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:57,066 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-18 11:46:57,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 11:46:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-18 11:46:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 11:46:57,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:57,067 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:57,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:57,274 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-18 11:46:57,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:57,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534083686] [2019-12-18 11:46:57,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:57,369 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-18 11:46:57,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534083686] [2019-12-18 11:46:57,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331031225] [2019-12-18 11:46:57,370 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-18 11:46:57,423 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-18 11:46:57,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:57,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 11:46:57,425 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:57,441 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-18 11:46:57,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:57,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 11:46:57,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373454734] [2019-12-18 11:46:57,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 11:46:57,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 11:46:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 11:46:57,444 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-18 11:46:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:57,596 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-18 11:46:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 11:46:57,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 11:46:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:57,599 INFO L225 Difference]: With dead ends: 41 [2019-12-18 11:46:57,599 INFO L226 Difference]: Without dead ends: 38 [2019-12-18 11:46:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-12-18 11:46:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-18 11:46:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-18 11:46:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 11:46:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-18 11:46:57,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-18 11:46:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-18 11:46:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 11:46:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-18 11:46:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:46:57,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:57,606 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:57,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:57,810 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-18 11:46:57,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:57,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171426920] [2019-12-18 11:46:57,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:57,899 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-18 11:46:57,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171426920] [2019-12-18 11:46:57,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599210156] [2019-12-18 11:46:57,900 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-18 11:46:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:57,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 11:46:57,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:57,977 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-18 11:46:57,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:57,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 11:46:57,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353732424] [2019-12-18 11:46:57,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 11:46:57,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 11:46:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 11:46:57,980 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-18 11:46:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:58,175 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-18 11:46:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 11:46:58,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 11:46:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:58,177 INFO L225 Difference]: With dead ends: 42 [2019-12-18 11:46:58,177 INFO L226 Difference]: Without dead ends: 39 [2019-12-18 11:46:58,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-18 11:46:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-18 11:46:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-18 11:46:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-18 11:46:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-18 11:46:58,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-18 11:46:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:58,182 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-18 11:46:58,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 11:46:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-18 11:46:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:46:58,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:58,183 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:58,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:58,386 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-18 11:46:58,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:58,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063332123] [2019-12-18 11:46:58,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:58,467 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-18 11:46:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063332123] [2019-12-18 11:46:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904378830] [2019-12-18 11:46:58,468 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-18 11:46:58,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 11:46:58,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:58,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 11:46:58,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:58,549 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-18 11:46:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:58,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 11:46:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010023187] [2019-12-18 11:46:58,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 11:46:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 11:46:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 11:46:58,551 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-18 11:46:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:58,728 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-18 11:46:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 11:46:58,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 11:46:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:58,729 INFO L225 Difference]: With dead ends: 43 [2019-12-18 11:46:58,729 INFO L226 Difference]: Without dead ends: 40 [2019-12-18 11:46:58,729 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-18 11:46:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-18 11:46:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-18 11:46:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-18 11:46:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-18 11:46:58,734 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-18 11:46:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:58,734 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-18 11:46:58,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 11:46:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-18 11:46:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 11:46:58,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:58,735 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:58,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:58,939 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-18 11:46:58,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:58,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983146627] [2019-12-18 11:46:58,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:59,043 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-18 11:46:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983146627] [2019-12-18 11:46:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420064164] [2019-12-18 11:46:59,044 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-18 11:46:59,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-18 11:46:59,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:59,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-18 11:46:59,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:59,116 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-18 11:46:59,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:59,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 11:46:59,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599829071] [2019-12-18 11:46:59,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 11:46:59,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 11:46:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 11:46:59,119 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-18 11:46:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:59,292 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-18 11:46:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 11:46:59,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 11:46:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:59,293 INFO L225 Difference]: With dead ends: 44 [2019-12-18 11:46:59,293 INFO L226 Difference]: Without dead ends: 41 [2019-12-18 11:46:59,294 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-18 11:46:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-18 11:46:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-18 11:46:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 11:46:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 11:46:59,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-18 11:46:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:59,298 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 11:46:59,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 11:46:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 11:46:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 11:46:59,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:59,299 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:46:59,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:46:59,502 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:46:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:46:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-18 11:46:59,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:46:59,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360472062] [2019-12-18 11:46:59,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:46:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:46:59,593 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-18 11:46:59,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360472062] [2019-12-18 11:46:59,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265465288] [2019-12-18 11:46:59,594 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-18 11:46:59,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 11:46:59,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 11:46:59,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-18 11:46:59,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 11:46:59,680 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-18 11:46:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 11:46:59,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 11:46:59,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97422489] [2019-12-18 11:46:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 11:46:59,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:46:59,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 11:46:59,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 11:46:59,681 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-18 11:46:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:46:59,870 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-18 11:46:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 11:46:59,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 11:46:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:46:59,871 INFO L225 Difference]: With dead ends: 45 [2019-12-18 11:46:59,871 INFO L226 Difference]: Without dead ends: 42 [2019-12-18 11:46:59,872 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-18 11:46:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-18 11:46:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-18 11:46:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-18 11:46:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-18 11:46:59,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-18 11:46:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:46:59,876 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-18 11:46:59,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 11:46:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-18 11:46:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 11:46:59,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:46:59,877 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:47:00,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 11:47:00,085 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:47:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:47:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-18 11:47:00,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:47:00,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531858273] [2019-12-18 11:47:00,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:47:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:47:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:47:00,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:47:00,146 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:47:00,151 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_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 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_~j~0_37 6) (< |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_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, 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_22, 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_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #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-18 11:47:00,151 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-18 11:47:00,151 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_12 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_12, 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-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 11:47:00,152 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_12) (= |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_12, 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-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 11:47:00,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 11:47:00,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 11:47:00,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 11:47:00,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condJ~0_15 0)) (.cse2 (= v_ULTIMATE.start_main_~condI~0_15 0))) (and (let ((.cse0 (<= 16 v_~j~0_27))) (or (and (not .cse0) .cse1) (and .cse0 (= v_ULTIMATE.start_main_~condJ~0_15 1)))) (or (not .cse2) (not .cse1)) (let ((.cse3 (<= 16 v_~i~0_25))) (or (and (= v_ULTIMATE.start_main_~condI~0_15 1) .cse3) (and .cse2 (not .cse3)))))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} 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-18 11:47:00,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:47:00 BasicIcfg [2019-12-18 11:47:00,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 11:47:00,169 INFO L168 Benchmark]: Toolchain (without parser) took 10734.60 ms. Allocated memory was 135.8 MB in the beginning and 323.5 MB in the end (delta: 187.7 MB). Free memory was 97.9 MB in the beginning and 261.1 MB in the end (delta: -163.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,169 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.11 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.7 MB in the beginning and 159.4 MB in the end (delta: -61.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.40 ms. Allocated memory is still 199.8 MB. Free memory was 159.4 MB in the beginning and 157.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,171 INFO L168 Benchmark]: Boogie Preprocessor took 38.44 ms. Allocated memory is still 199.8 MB. Free memory was 157.4 MB in the beginning and 155.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,171 INFO L168 Benchmark]: RCFGBuilder took 425.12 ms. Allocated memory is still 199.8 MB. Free memory was 155.9 MB in the beginning and 135.8 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-12-18 11:47:00,172 INFO L168 Benchmark]: TraceAbstraction took 9526.53 ms. Allocated memory was 199.8 MB in the beginning and 323.5 MB in the end (delta: 123.7 MB). Free memory was 135.8 MB in the beginning and 261.1 MB in the end (delta: -125.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 11:47:00,174 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.48 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 681.11 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.7 MB in the beginning and 159.4 MB in the end (delta: -61.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.40 ms. Allocated memory is still 199.8 MB. Free memory was 159.4 MB in the beginning and 157.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.44 ms. Allocated memory is still 199.8 MB. Free memory was 157.4 MB in the beginning and 155.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 425.12 ms. Allocated memory is still 199.8 MB. Free memory was 155.9 MB in the beginning and 135.8 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9526.53 ms. Allocated memory was 199.8 MB in the beginning and 323.5 MB in the end (delta: 123.7 MB). Free memory was 135.8 MB in the beginning and 261.1 MB in the end (delta: -125.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 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, 9 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: 9.3s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 192 SDtfs, 518 SDslu, 319 SDs, 0 SdLazy, 389 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=18, 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, 18 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 14804 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1316 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 0/200 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...