./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f63c6229f0a09709710be77b7ac5a08c2c6f5392 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:47:39,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:47:39,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:47:39,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:47:39,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:47:39,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:47:39,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:47:39,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:47:39,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:47:39,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:47:39,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:47:39,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:47:39,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:47:39,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:47:39,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:47:39,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:47:39,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:47:39,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:47:39,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:47:39,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:47:39,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:47:39,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:47:39,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:47:39,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:47:39,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:47:39,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:47:39,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:47:39,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:47:39,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:47:39,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:47:39,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:47:39,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:47:39,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:47:39,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:47:39,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:47:39,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:47:39,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:47:39,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:47:39,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:47:39,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:47:39,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:47:39,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:47:39,330 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:47:39,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:47:39,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:47:39,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:47:39,335 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:47:39,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:47:39,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:47:39,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:47:39,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:47:39,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:47:39,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:47:39,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:47:39,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:47:39,339 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:47:39,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:47:39,340 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:47:39,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:47:39,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:47:39,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:47:39,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:47:39,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:47:39,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:47:39,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:47:39,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:47:39,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:47:39,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:47:39,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:47:39,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:47:39,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:47:39,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f63c6229f0a09709710be77b7ac5a08c2c6f5392 [2020-10-20 01:47:39,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:47:39,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:47:39,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:47:39,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:47:39,593 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:47:39,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-10-20 01:47:39,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ae9a0ab/42c3b61cca1a437ea623ddb15efa69b4/FLAG405b354cf [2020-10-20 01:47:40,384 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:47:40,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-10-20 01:47:40,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ae9a0ab/42c3b61cca1a437ea623ddb15efa69b4/FLAG405b354cf [2020-10-20 01:47:40,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ae9a0ab/42c3b61cca1a437ea623ddb15efa69b4 [2020-10-20 01:47:40,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:47:40,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:47:40,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:40,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:47:40,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:47:40,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:40" (1/1) ... [2020-10-20 01:47:40,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e08bd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:40, skipping insertion in model container [2020-10-20 01:47:40,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:47:40" (1/1) ... [2020-10-20 01:47:40,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:47:40,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:47:40,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:41,009 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:47:41,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:47:41,043 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:47:41,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41 WrapperNode [2020-10-20 01:47:41,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:47:41,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:41,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:47:41,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:47:41,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:47:41,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:47:41,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:47:41,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:47:41,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (1/1) ... [2020-10-20 01:47:41,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:47:41,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:47:41,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:47:41,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:47:41,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (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 [2020-10-20 01:47:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:47:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-20 01:47:41,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-20 01:47:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:47:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-20 01:47:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-20 01:47:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:47:41,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:47:41,471 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:47:41,472 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-20 01:47:41,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:41 BoogieIcfgContainer [2020-10-20 01:47:41,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:47:41,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:47:41,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:47:41,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:47:41,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:47:40" (1/3) ... [2020-10-20 01:47:41,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77126bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:41, skipping insertion in model container [2020-10-20 01:47:41,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:47:41" (2/3) ... [2020-10-20 01:47:41,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77126bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:47:41, skipping insertion in model container [2020-10-20 01:47:41,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:41" (3/3) ... [2020-10-20 01:47:41,490 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-10-20 01:47:41,507 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:47:41,519 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:47:41,539 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:47:41,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:47:41,578 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:47:41,579 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:47:41,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:47:41,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:47:41,580 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:47:41,580 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:47:41,580 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:47:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-10-20 01:47:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 01:47:41,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:41,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:41,616 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2146840844, now seen corresponding path program 1 times [2020-10-20 01:47:41,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:41,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358495162] [2020-10-20 01:47:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:41,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358495162] [2020-10-20 01:47:41,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:41,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:41,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49111643] [2020-10-20 01:47:41,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:41,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:41,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:41,967 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-10-20 01:47:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:42,026 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-10-20 01:47:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:42,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-20 01:47:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:42,041 INFO L225 Difference]: With dead ends: 44 [2020-10-20 01:47:42,042 INFO L226 Difference]: Without dead ends: 27 [2020-10-20 01:47:42,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-20 01:47:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 01:47:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 01:47:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 01:47:42,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2020-10-20 01:47:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:42,098 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 01:47:42,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-20 01:47:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 01:47:42,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:42,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:42,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:47:42,101 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1412337332, now seen corresponding path program 1 times [2020-10-20 01:47:42,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:42,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029574076] [2020-10-20 01:47:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:47:42,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029574076] [2020-10-20 01:47:42,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:47:42,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:47:42,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938942822] [2020-10-20 01:47:42,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:47:42,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:47:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:42,218 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2020-10-20 01:47:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:42,244 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-10-20 01:47:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:47:42,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 01:47:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:42,246 INFO L225 Difference]: With dead ends: 33 [2020-10-20 01:47:42,247 INFO L226 Difference]: Without dead ends: 29 [2020-10-20 01:47:42,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:47:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-20 01:47:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-10-20 01:47:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 01:47:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-20 01:47:42,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2020-10-20 01:47:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:42,258 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-20 01:47:42,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:47:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-20 01:47:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:47:42,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:42,261 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:42,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:47:42,261 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -888595213, now seen corresponding path program 1 times [2020-10-20 01:47:42,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:42,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326132948] [2020-10-20 01:47:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:47:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:42,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326132948] [2020-10-20 01:47:42,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006208876] [2020-10-20 01:47:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:42,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:42,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:42,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:42,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2020-10-20 01:47:42,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442040509] [2020-10-20 01:47:42,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 01:47:42,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 01:47:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-20 01:47:42,684 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2020-10-20 01:47:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:42,946 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2020-10-20 01:47:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 01:47:42,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-20 01:47:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:42,948 INFO L225 Difference]: With dead ends: 55 [2020-10-20 01:47:42,949 INFO L226 Difference]: Without dead ends: 31 [2020-10-20 01:47:42,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-10-20 01:47:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-20 01:47:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-10-20 01:47:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 01:47:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-10-20 01:47:42,959 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2020-10-20 01:47:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:42,960 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-10-20 01:47:42,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 01:47:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-10-20 01:47:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 01:47:42,962 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:42,962 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:43,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-20 01:47:43,176 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1502460051, now seen corresponding path program 1 times [2020-10-20 01:47:43,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:43,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556908556] [2020-10-20 01:47:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:43,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556908556] [2020-10-20 01:47:43,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386124728] [2020-10-20 01:47:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 01:47:43,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:47:43,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:43,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 01:47:43,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757240637] [2020-10-20 01:47:43,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 01:47:43,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 01:47:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:47:43,415 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 9 states. [2020-10-20 01:47:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:43,599 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-10-20 01:47:43,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:47:43,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-20 01:47:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:43,603 INFO L225 Difference]: With dead ends: 51 [2020-10-20 01:47:43,603 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 01:47:43,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:47:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 01:47:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-20 01:47:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 01:47:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-10-20 01:47:43,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2020-10-20 01:47:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:43,617 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-10-20 01:47:43,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 01:47:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-10-20 01:47:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-20 01:47:43,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:43,620 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:43,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:43,835 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:43,836 INFO L82 PathProgramCache]: Analyzing trace with hash -801267146, now seen corresponding path program 1 times [2020-10-20 01:47:43,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:43,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292598901] [2020-10-20 01:47:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 01:47:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 01:47:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:47:43,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292598901] [2020-10-20 01:47:43,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040165441] [2020-10-20 01:47:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:44,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:47:44,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:44,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-10-20 01:47:44,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194944056] [2020-10-20 01:47:44,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 01:47:44,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 01:47:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 01:47:44,163 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 11 states. [2020-10-20 01:47:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:44,433 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2020-10-20 01:47:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 01:47:44,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2020-10-20 01:47:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:44,437 INFO L225 Difference]: With dead ends: 105 [2020-10-20 01:47:44,438 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 01:47:44,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-10-20 01:47:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 01:47:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-20 01:47:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 01:47:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2020-10-20 01:47:44,467 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2020-10-20 01:47:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:44,467 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2020-10-20 01:47:44,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 01:47:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2020-10-20 01:47:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:47:44,474 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:44,474 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:44,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:44,680 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1583643682, now seen corresponding path program 1 times [2020-10-20 01:47:44,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:44,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645077718] [2020-10-20 01:47:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-20 01:47:44,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645077718] [2020-10-20 01:47:44,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490723769] [2020-10-20 01:47:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:44,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 01:47:44,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 01:47:44,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:44,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-20 01:47:44,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490211325] [2020-10-20 01:47:44,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 01:47:44,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:44,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 01:47:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-20 01:47:44,959 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand 13 states. [2020-10-20 01:47:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:45,422 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2020-10-20 01:47:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 01:47:45,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-10-20 01:47:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:45,426 INFO L225 Difference]: With dead ends: 177 [2020-10-20 01:47:45,427 INFO L226 Difference]: Without dead ends: 117 [2020-10-20 01:47:45,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-10-20 01:47:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-20 01:47:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2020-10-20 01:47:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 01:47:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2020-10-20 01:47:45,469 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2020-10-20 01:47:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:45,470 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2020-10-20 01:47:45,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 01:47:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2020-10-20 01:47:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:47:45,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:45,480 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:45,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:45,681 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1063158393, now seen corresponding path program 1 times [2020-10-20 01:47:45,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:45,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44508413] [2020-10-20 01:47:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-10-20 01:47:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 01:47:45,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44508413] [2020-10-20 01:47:45,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035444398] [2020-10-20 01:47:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order 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 [2020-10-20 01:47:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:45,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 01:47:45,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-20 01:47:46,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:46,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-10-20 01:47:46,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153604688] [2020-10-20 01:47:46,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 01:47:46,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 01:47:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-20 01:47:46,069 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand 14 states. [2020-10-20 01:47:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:46,637 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2020-10-20 01:47:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 01:47:46,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-10-20 01:47:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:46,644 INFO L225 Difference]: With dead ends: 255 [2020-10-20 01:47:46,644 INFO L226 Difference]: Without dead ends: 155 [2020-10-20 01:47:46,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-10-20 01:47:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-20 01:47:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2020-10-20 01:47:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 01:47:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2020-10-20 01:47:46,685 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2020-10-20 01:47:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:46,686 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2020-10-20 01:47:46,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 01:47:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2020-10-20 01:47:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-20 01:47:46,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:46,695 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:46,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 01:47:46,909 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1732889556, now seen corresponding path program 1 times [2020-10-20 01:47:46,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:46,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616961014] [2020-10-20 01:47:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:46,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:46,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:46,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-20 01:47:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-20 01:47:47,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616961014] [2020-10-20 01:47:47,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051613886] [2020-10-20 01:47:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 01:47:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:47,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:47:47,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-10-20 01:47:47,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:47,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-10-20 01:47:47,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805801172] [2020-10-20 01:47:47,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 01:47:47,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:47,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 01:47:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-10-20 01:47:47,315 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand 16 states. [2020-10-20 01:47:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:48,007 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2020-10-20 01:47:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-20 01:47:48,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2020-10-20 01:47:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:48,009 INFO L225 Difference]: With dead ends: 240 [2020-10-20 01:47:48,009 INFO L226 Difference]: Without dead ends: 107 [2020-10-20 01:47:48,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-10-20 01:47:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-20 01:47:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2020-10-20 01:47:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 01:47:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-20 01:47:48,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 93 [2020-10-20 01:47:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:48,057 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-20 01:47:48,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 01:47:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-20 01:47:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-20 01:47:48,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:48,064 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:48,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:48,266 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash 740260986, now seen corresponding path program 2 times [2020-10-20 01:47:48,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:48,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388471008] [2020-10-20 01:47:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-20 01:47:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-10-20 01:47:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-10-20 01:47:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 67 proven. 142 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2020-10-20 01:47:48,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388471008] [2020-10-20 01:47:48,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196426963] [2020-10-20 01:47:48,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-20 01:47:48,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 01:47:48,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:48,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 01:47:48,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 30 proven. 217 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2020-10-20 01:47:48,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:48,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2020-10-20 01:47:48,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129356679] [2020-10-20 01:47:48,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-20 01:47:48,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 01:47:48,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-20 01:47:48,873 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 17 states. [2020-10-20 01:47:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:49,545 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2020-10-20 01:47:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-20 01:47:49,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2020-10-20 01:47:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:49,548 INFO L225 Difference]: With dead ends: 214 [2020-10-20 01:47:49,548 INFO L226 Difference]: Without dead ends: 134 [2020-10-20 01:47:49,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-10-20 01:47:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-20 01:47:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2020-10-20 01:47:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-20 01:47:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2020-10-20 01:47:49,566 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 148 [2020-10-20 01:47:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:49,567 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2020-10-20 01:47:49,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-20 01:47:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2020-10-20 01:47:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2020-10-20 01:47:49,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:49,573 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:49,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:49,788 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 341307334, now seen corresponding path program 3 times [2020-10-20 01:47:49,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:49,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671900189] [2020-10-20 01:47:49,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:49,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:49,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:49,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-20 01:47:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-20 01:47:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 170 proven. 320 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2020-10-20 01:47:50,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671900189] [2020-10-20 01:47:50,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550613169] [2020-10-20 01:47:50,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-20 01:47:50,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-20 01:47:50,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:50,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:47:50,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 460 proven. 33 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2020-10-20 01:47:50,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:50,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2020-10-20 01:47:50,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142326855] [2020-10-20 01:47:50,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 01:47:50,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 01:47:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2020-10-20 01:47:50,703 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 20 states. [2020-10-20 01:47:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:51,239 INFO L93 Difference]: Finished difference Result 239 states and 381 transitions. [2020-10-20 01:47:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 01:47:51,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 255 [2020-10-20 01:47:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:51,243 INFO L225 Difference]: With dead ends: 239 [2020-10-20 01:47:51,244 INFO L226 Difference]: Without dead ends: 130 [2020-10-20 01:47:51,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2020-10-20 01:47:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-20 01:47:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-20 01:47:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-20 01:47:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2020-10-20 01:47:51,270 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 255 [2020-10-20 01:47:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:51,271 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2020-10-20 01:47:51,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 01:47:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2020-10-20 01:47:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-20 01:47:51,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:51,286 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 29, 29, 26, 25, 17, 17, 17, 17, 17, 17, 17, 14, 14, 14, 14, 14, 14, 14, 12, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:51,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 01:47:51,501 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 829071849, now seen corresponding path program 4 times [2020-10-20 01:47:51,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:51,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309465536] [2020-10-20 01:47:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:51,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:51,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:51,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-10-20 01:47:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 309 proven. 1208 refuted. 0 times theorem prover too weak. 3884 trivial. 0 not checked. [2020-10-20 01:47:52,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309465536] [2020-10-20 01:47:52,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941532116] [2020-10-20 01:47:52,781 INFO L93 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 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 [2020-10-20 01:47:52,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 01:47:52,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:52,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 01:47:52,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 130 proven. 938 refuted. 0 times theorem prover too weak. 4333 trivial. 0 not checked. [2020-10-20 01:47:53,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:53,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 20 [2020-10-20 01:47:53,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971265557] [2020-10-20 01:47:53,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 01:47:53,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 01:47:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2020-10-20 01:47:53,129 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand 20 states. [2020-10-20 01:47:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:54,044 INFO L93 Difference]: Finished difference Result 298 states and 484 transitions. [2020-10-20 01:47:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-20 01:47:54,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 433 [2020-10-20 01:47:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:54,049 INFO L225 Difference]: With dead ends: 298 [2020-10-20 01:47:54,049 INFO L226 Difference]: Without dead ends: 177 [2020-10-20 01:47:54,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2020-10-20 01:47:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-10-20 01:47:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2020-10-20 01:47:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-20 01:47:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2020-10-20 01:47:54,067 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 433 [2020-10-20 01:47:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:54,068 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2020-10-20 01:47:54,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 01:47:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2020-10-20 01:47:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-20 01:47:54,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:54,077 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:54,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:54,292 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 902497613, now seen corresponding path program 5 times [2020-10-20 01:47:54,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:54,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201712039] [2020-10-20 01:47:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:54,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-20 01:47:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-20 01:47:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:55,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1102 proven. 902 refuted. 0 times theorem prover too weak. 3365 trivial. 0 not checked. [2020-10-20 01:47:56,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201712039] [2020-10-20 01:47:56,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968801280] [2020-10-20 01:47:56,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-10-20 01:47:56,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-10-20 01:47:56,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:56,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 01:47:56,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 918 proven. 135 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2020-10-20 01:47:56,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:56,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 28 [2020-10-20 01:47:56,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299624880] [2020-10-20 01:47:56,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-20 01:47:56,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-20 01:47:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2020-10-20 01:47:56,594 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 28 states. [2020-10-20 01:47:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:47:57,843 INFO L93 Difference]: Finished difference Result 357 states and 602 transitions. [2020-10-20 01:47:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-20 01:47:57,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 433 [2020-10-20 01:47:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:47:57,849 INFO L225 Difference]: With dead ends: 357 [2020-10-20 01:47:57,849 INFO L226 Difference]: Without dead ends: 208 [2020-10-20 01:47:57,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=1945, Unknown=0, NotChecked=0, Total=2256 [2020-10-20 01:47:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-20 01:47:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2020-10-20 01:47:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-20 01:47:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2020-10-20 01:47:57,869 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 433 [2020-10-20 01:47:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:47:57,871 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2020-10-20 01:47:57,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-20 01:47:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2020-10-20 01:47:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2020-10-20 01:47:57,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:47:57,883 INFO L422 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 7, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:47:58,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:47:58,099 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:47:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:47:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1878610003, now seen corresponding path program 6 times [2020-10-20 01:47:58,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:47:58,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936019930] [2020-10-20 01:47:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:47:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:47:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:47:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-10-20 01:47:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2020-10-20 01:47:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:58,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:47:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:47:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:47:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:47:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:47:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:47:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 849 proven. 1278 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2020-10-20 01:47:59,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936019930] [2020-10-20 01:47:59,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261574429] [2020-10-20 01:47:59,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2020-10-20 01:47:59,443 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2020-10-20 01:47:59,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 01:47:59,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 01:47:59,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:47:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5377 backedges. 660 proven. 100 refuted. 0 times theorem prover too weak. 4617 trivial. 0 not checked. [2020-10-20 01:47:59,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:47:59,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 24 [2020-10-20 01:47:59,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692972221] [2020-10-20 01:47:59,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 01:47:59,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:47:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 01:47:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2020-10-20 01:47:59,703 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand 24 states. [2020-10-20 01:48:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:48:00,707 INFO L93 Difference]: Finished difference Result 409 states and 617 transitions. [2020-10-20 01:48:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-20 01:48:00,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 433 [2020-10-20 01:48:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:48:00,715 INFO L225 Difference]: With dead ends: 409 [2020-10-20 01:48:00,715 INFO L226 Difference]: Without dead ends: 229 [2020-10-20 01:48:00,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=2024, Unknown=0, NotChecked=0, Total=2352 [2020-10-20 01:48:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-20 01:48:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 187. [2020-10-20 01:48:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-20 01:48:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2020-10-20 01:48:00,747 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 433 [2020-10-20 01:48:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:48:00,748 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2020-10-20 01:48:00,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 01:48:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2020-10-20 01:48:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2020-10-20 01:48:00,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:48:00,756 INFO L422 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 46, 45, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 18, 17, 12, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:48:00,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-20 01:48:00,971 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:48:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:48:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -42359494, now seen corresponding path program 7 times [2020-10-20 01:48:00,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:48:00,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446486173] [2020-10-20 01:48:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:48:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 01:48:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:48:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:48:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:01,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-20 01:48:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:48:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:48:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2020-10-20 01:48:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:48:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:48:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-20 01:48:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-10-20 01:48:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-20 01:48:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-20 01:48:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-20 01:48:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-20 01:48:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-20 01:48:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:02,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-20 01:48:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17593 backedges. 629 proven. 2860 refuted. 0 times theorem prover too weak. 14104 trivial. 0 not checked. [2020-10-20 01:48:03,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446486173] [2020-10-20 01:48:03,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433426462] [2020-10-20 01:48:03,654 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2020-10-20 01:48:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:48:03,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 1746 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 01:48:03,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:48:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17593 backedges. 709 proven. 1621 refuted. 0 times theorem prover too weak. 15263 trivial. 0 not checked. [2020-10-20 01:48:04,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:48:04,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2020-10-20 01:48:04,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060467815] [2020-10-20 01:48:04,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-20 01:48:04,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:48:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-20 01:48:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2020-10-20 01:48:04,282 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand 23 states. [2020-10-20 01:48:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:48:05,692 INFO L93 Difference]: Finished difference Result 444 states and 754 transitions. [2020-10-20 01:48:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-10-20 01:48:05,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 773 [2020-10-20 01:48:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:48:05,698 INFO L225 Difference]: With dead ends: 444 [2020-10-20 01:48:05,698 INFO L226 Difference]: Without dead ends: 224 [2020-10-20 01:48:05,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1049 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=400, Invalid=2680, Unknown=0, NotChecked=0, Total=3080 [2020-10-20 01:48:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-20 01:48:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 197. [2020-10-20 01:48:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-10-20 01:48:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 267 transitions. [2020-10-20 01:48:05,721 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 267 transitions. Word has length 773 [2020-10-20 01:48:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:48:05,722 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 267 transitions. [2020-10-20 01:48:05,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-20 01:48:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 267 transitions. [2020-10-20 01:48:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-10-20 01:48:05,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:48:05,726 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:48:05,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-20 01:48:05,939 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:48:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:48:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -232840799, now seen corresponding path program 8 times [2020-10-20 01:48:05,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:48:05,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901247465] [2020-10-20 01:48:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:48:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:48:05,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:48:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:48:06,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:48:06,223 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:48:06,223 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:48:06,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:48:06,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:48:06 BoogieIcfgContainer [2020-10-20 01:48:06,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:48:06,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:48:06,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:48:06,481 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:48:06,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:47:41" (3/4) ... [2020-10-20 01:48:06,484 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:48:06,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:48:06,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:48:06,661 INFO L168 Benchmark]: Toolchain (without parser) took 25909.55 ms. Allocated memory was 41.9 MB in the beginning and 443.0 MB in the end (delta: 401.1 MB). Free memory was 22.0 MB in the beginning and 27.4 MB in the end (delta: -5.4 MB). Peak memory consumption was 395.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,661 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 32.0 MB. Free memory was 11.1 MB in the beginning and 11.0 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.63 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.1 MB in the beginning and 22.5 MB in the end (delta: -1.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 42.5 MB. Free memory was 22.5 MB in the beginning and 20.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,663 INFO L168 Benchmark]: Boogie Preprocessor took 29.05 ms. Allocated memory is still 42.5 MB. Free memory was 20.9 MB in the beginning and 19.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,663 INFO L168 Benchmark]: RCFGBuilder took 360.87 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 19.6 MB in the beginning and 22.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,664 INFO L168 Benchmark]: TraceAbstraction took 25001.89 ms. Allocated memory was 44.0 MB in the beginning and 443.0 MB in the end (delta: 399.0 MB). Free memory was 22.3 MB in the beginning and 51.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 370.0 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,664 INFO L168 Benchmark]: Witness Printer took 177.91 ms. Allocated memory is still 443.0 MB. Free memory was 51.3 MB in the beginning and 27.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:48:06,667 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 32.0 MB. Free memory was 11.1 MB in the beginning and 11.0 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 285.63 ms. Allocated memory was 41.9 MB in the beginning and 42.5 MB in the end (delta: 524.3 kB). Free memory was 21.1 MB in the beginning and 22.5 MB in the end (delta: -1.4 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 42.5 MB. Free memory was 22.5 MB in the beginning and 20.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.05 ms. Allocated memory is still 42.5 MB. Free memory was 20.9 MB in the beginning and 19.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 360.87 ms. Allocated memory was 42.5 MB in the beginning and 44.0 MB in the end (delta: 1.6 MB). Free memory was 19.6 MB in the beginning and 22.8 MB in the end (delta: -3.2 MB). Peak memory consumption was 10.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 25001.89 ms. Allocated memory was 44.0 MB in the beginning and 443.0 MB in the end (delta: 399.0 MB). Free memory was 22.3 MB in the beginning and 51.3 MB in the end (delta: -29.0 MB). Peak memory consumption was 370.0 MB. Max. memory is 14.3 GB. * Witness Printer took 177.91 ms. Allocated memory is still 443.0 MB. Free memory was 51.3 MB in the beginning and 27.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 8; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 21 [L4] __assert_fail("0", "fibo_2calls_8-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.6s, OverallIterations: 15, TraceHistogramMax: 57, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 460 SDtfs, 919 SDslu, 3458 SDs, 0 SdLazy, 6170 SolverSat, 1044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3872 GetRequests, 3511 SyntacticMatches, 0 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 202 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 5959 NumberOfCodeBlocks, 5498 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5473 ConstructedInterpolants, 0 QuantifiedInterpolants, 3194115 SizeOfPredicates, 68 NumberOfNonLiveVariables, 5308 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 62759/72726 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...