./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/nested-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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.5.800.v20200727-1323.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/loop-new/nested-1.i -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 7f63971ff7e1e47adf4fc8a9c16196a6401c3822 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:48:45,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:48:45,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:48:45,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:48:45,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:48:45,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:48:45,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:48:45,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:48:45,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:48:45,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:48:45,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:48:45,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:48:45,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:48:45,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:48:45,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:48:45,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:48:45,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:48:45,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:48:45,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:48:45,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:48:45,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:48:45,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:48:45,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:48:45,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:48:45,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:48:45,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:48:45,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:48:45,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:48:45,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:48:45,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:48:45,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:48:45,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:48:45,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:48:45,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:48:45,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:48:45,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:48:45,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:48:45,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:48:45,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:48:45,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:48:45,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:48:45,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:48:45,492 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:48:45,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:48:45,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:48:45,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:48:45,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:48:45,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:48:45,496 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:48:45,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:48:45,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:48:45,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:48:45,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:48:45,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:48:45,498 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:48:45,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:48:45,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:48:45,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:48:45,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:48:45,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:48:45,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:48:45,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:48:45,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:48:45,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:48:45,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:48:45,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:48:45,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:48:45,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 7f63971ff7e1e47adf4fc8a9c16196a6401c3822 [2021-08-26 03:48:45,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:48:45,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:48:45,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:48:45,744 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:48:45,745 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:48:45,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/nested-1.i [2021-08-26 03:48:45,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec308f2a3/fcbc13443fbb4976b1c5b6cca0c72806/FLAG6d9631b66 [2021-08-26 03:48:46,127 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:48:46,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i [2021-08-26 03:48:46,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec308f2a3/fcbc13443fbb4976b1c5b6cca0c72806/FLAG6d9631b66 [2021-08-26 03:48:46,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec308f2a3/fcbc13443fbb4976b1c5b6cca0c72806 [2021-08-26 03:48:46,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:48:46,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:48:46,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:48:46,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:48:46,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:48:46,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4516d448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46, skipping insertion in model container [2021-08-26 03:48:46,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:48:46,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:48:46,292 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2021-08-26 03:48:46,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:48:46,309 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:48:46,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2021-08-26 03:48:46,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:48:46,339 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:48:46,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46 WrapperNode [2021-08-26 03:48:46,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:48:46,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:48:46,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:48:46,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:48:46,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:48:46,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:48:46,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:48:46,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:48:46,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:48:46,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:48:46,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:48:46,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:48:46,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (1/1) ... [2021-08-26 03:48:46,391 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:48:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:46,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:48:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:48:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:48:46,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:48:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:48:46,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:48:46,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:48:46,669 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-26 03:48:46,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:48:46 BoogieIcfgContainer [2021-08-26 03:48:46,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:48:46,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:48:46,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:48:46,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:48:46,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:48:46" (1/3) ... [2021-08-26 03:48:46,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302207b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:48:46, skipping insertion in model container [2021-08-26 03:48:46,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:48:46" (2/3) ... [2021-08-26 03:48:46,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302207b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:48:46, skipping insertion in model container [2021-08-26 03:48:46,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:48:46" (3/3) ... [2021-08-26 03:48:46,689 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-1.i [2021-08-26 03:48:46,693 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:48:46,693 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 03:48:46,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:48:46,759 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:48:46,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 03:48:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 03:48:46,792 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:46,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:46,793 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash 179613278, now seen corresponding path program 1 times [2021-08-26 03:48:46,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:46,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134050779] [2021-08-26 03:48:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:46,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:47,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134050779] [2021-08-26 03:48:47,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134050779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:48:47,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:48:47,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:48:47,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514592981] [2021-08-26 03:48:47,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:48:47,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:47,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:48:47,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:48:47,022 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:47,052 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2021-08-26 03:48:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:48:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 03:48:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:47,058 INFO L225 Difference]: With dead ends: 35 [2021-08-26 03:48:47,058 INFO L226 Difference]: Without dead ends: 16 [2021-08-26 03:48:47,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:48:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-08-26 03:48:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2021-08-26 03:48:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-26 03:48:47,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-08-26 03:48:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:47,091 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-26 03:48:47,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-08-26 03:48:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:48:47,091 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:47,092 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:47,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:48:47,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash 754200042, now seen corresponding path program 1 times [2021-08-26 03:48:47,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:47,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849648506] [2021-08-26 03:48:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:47,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:47,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849648506] [2021-08-26 03:48:47,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849648506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:48:47,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:48:47,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:48:47,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957947619] [2021-08-26 03:48:47,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:48:47,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:48:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:48:47,156 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:47,175 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-08-26 03:48:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:48:47,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:48:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:47,177 INFO L225 Difference]: With dead ends: 23 [2021-08-26 03:48:47,177 INFO L226 Difference]: Without dead ends: 15 [2021-08-26 03:48:47,178 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:48:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-08-26 03:48:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-08-26 03:48:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-08-26 03:48:47,184 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-08-26 03:48:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:47,185 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-26 03:48:47,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-08-26 03:48:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:48:47,187 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:47,187 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:47,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:48:47,188 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash -902976276, now seen corresponding path program 1 times [2021-08-26 03:48:47,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:47,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709227493] [2021-08-26 03:48:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:47,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:47,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709227493] [2021-08-26 03:48:47,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709227493] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:47,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634301251] [2021-08-26 03:48:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:47,287 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:47,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:47,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:47,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 03:48:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:47,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:48:47,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634301251] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:47,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:47,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-26 03:48:47,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907936713] [2021-08-26 03:48:47,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 03:48:47,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 03:48:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:48:47,470 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:47,495 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-08-26 03:48:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:48:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:48:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:47,496 INFO L225 Difference]: With dead ends: 26 [2021-08-26 03:48:47,496 INFO L226 Difference]: Without dead ends: 17 [2021-08-26 03:48:47,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:48:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-08-26 03:48:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-26 03:48:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-08-26 03:48:47,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2021-08-26 03:48:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:47,502 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-26 03:48:47,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-08-26 03:48:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 03:48:47,503 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:47,504 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:47,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:47,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:47,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash -16551058, now seen corresponding path program 2 times [2021-08-26 03:48:47,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:47,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902609576] [2021-08-26 03:48:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:47,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:47,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902609576] [2021-08-26 03:48:47,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902609576] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:47,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458450650] [2021-08-26 03:48:47,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 03:48:47,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:47,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:47,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:47,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 03:48:47,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 03:48:47,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:47,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 03:48:47,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:47,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458450650] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:47,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:47,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-26 03:48:47,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325518973] [2021-08-26 03:48:47,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 03:48:47,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 03:48:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:48:47,942 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:47,972 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-08-26 03:48:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:48:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 03:48:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:47,973 INFO L225 Difference]: With dead ends: 30 [2021-08-26 03:48:47,974 INFO L226 Difference]: Without dead ends: 19 [2021-08-26 03:48:47,975 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 44.0ms TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:48:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-08-26 03:48:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-08-26 03:48:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-08-26 03:48:47,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2021-08-26 03:48:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:47,979 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-08-26 03:48:47,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-08-26 03:48:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 03:48:47,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:47,981 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:48,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:48,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-26 03:48:48,196 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1434558832, now seen corresponding path program 3 times [2021-08-26 03:48:48,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:48,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341473707] [2021-08-26 03:48:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:48,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:48:48,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:48,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341473707] [2021-08-26 03:48:48,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341473707] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:48,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579741138] [2021-08-26 03:48:48,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 03:48:48,247 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:48,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:48,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:48,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 03:48:48,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 03:48:48,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:48,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 03:48:48,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 03:48:48,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579741138] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:48,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:48,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2021-08-26 03:48:48,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816190521] [2021-08-26 03:48:48,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 03:48:48,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 03:48:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-26 03:48:48,452 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:48,638 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-08-26 03:48:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-26 03:48:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 03:48:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:48,639 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:48:48,639 INFO L226 Difference]: Without dead ends: 44 [2021-08-26 03:48:48,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 168.9ms TimeCoverageRelationStatistics Valid=207, Invalid=393, Unknown=0, NotChecked=0, Total=600 [2021-08-26 03:48:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-26 03:48:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2021-08-26 03:48:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-08-26 03:48:48,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2021-08-26 03:48:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:48,643 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-08-26 03:48:48,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2021-08-26 03:48:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-26 03:48:48,644 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:48,644 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:48,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:48,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:48,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1316009506, now seen corresponding path program 4 times [2021-08-26 03:48:48,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:48,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647230156] [2021-08-26 03:48:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:48,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-26 03:48:48,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:48,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647230156] [2021-08-26 03:48:48,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647230156] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:48,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865401619] [2021-08-26 03:48:48,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 03:48:48,918 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:48,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:48,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:48,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 03:48:49,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 03:48:49,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:49,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 03:48:49,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-26 03:48:49,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865401619] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:49,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:49,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-08-26 03:48:49,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335324939] [2021-08-26 03:48:49,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:48:49,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:48:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:48:49,148 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:49,172 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-08-26 03:48:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:48:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-26 03:48:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:49,173 INFO L225 Difference]: With dead ends: 54 [2021-08-26 03:48:49,173 INFO L226 Difference]: Without dead ends: 37 [2021-08-26 03:48:49,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:48:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-08-26 03:48:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-08-26 03:48:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-08-26 03:48:49,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2021-08-26 03:48:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:49,178 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-08-26 03:48:49,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2021-08-26 03:48:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 03:48:49,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:49,179 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:49,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-26 03:48:49,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:49,395 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash 158921246, now seen corresponding path program 5 times [2021-08-26 03:48:49,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:49,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018151391] [2021-08-26 03:48:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:49,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-26 03:48:49,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:49,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018151391] [2021-08-26 03:48:49,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018151391] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:49,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928297694] [2021-08-26 03:48:49,479 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 03:48:49,479 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:49,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:49,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 03:48:49,571 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-08-26 03:48:49,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:49,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 03:48:49,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 63 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-26 03:48:49,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928297694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:49,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:49,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-26 03:48:49,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201637068] [2021-08-26 03:48:49,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 03:48:49,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:49,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 03:48:49,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 03:48:49,745 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:49,774 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-08-26 03:48:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 03:48:49,775 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 03:48:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:49,776 INFO L225 Difference]: With dead ends: 60 [2021-08-26 03:48:49,776 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 03:48:49,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 03:48:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 03:48:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-08-26 03:48:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-26 03:48:49,779 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2021-08-26 03:48:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:49,779 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-26 03:48:49,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-08-26 03:48:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 03:48:49,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:49,780 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:49,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:49,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:49,998 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash -244827298, now seen corresponding path program 6 times [2021-08-26 03:48:49,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:49,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123209162] [2021-08-26 03:48:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:49,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-26 03:48:50,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:50,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123209162] [2021-08-26 03:48:50,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123209162] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:50,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022665975] [2021-08-26 03:48:50,077 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 03:48:50,077 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:50,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:50,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 03:48:50,211 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-26 03:48:50,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:50,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 03:48:50,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-08-26 03:48:50,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022665975] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:50,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:50,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2021-08-26 03:48:50,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590575521] [2021-08-26 03:48:50,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 03:48:50,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 03:48:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-08-26 03:48:50,449 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:50,925 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2021-08-26 03:48:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-26 03:48:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-26 03:48:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:50,927 INFO L225 Difference]: With dead ends: 101 [2021-08-26 03:48:50,927 INFO L226 Difference]: Without dead ends: 80 [2021-08-26 03:48:50,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 456.8ms TimeCoverageRelationStatistics Valid=669, Invalid=1401, Unknown=0, NotChecked=0, Total=2070 [2021-08-26 03:48:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-26 03:48:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2021-08-26 03:48:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-08-26 03:48:50,933 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 38 [2021-08-26 03:48:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:50,933 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-08-26 03:48:50,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-08-26 03:48:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-26 03:48:50,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:50,934 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:50,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:51,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:51,150 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2099079880, now seen corresponding path program 7 times [2021-08-26 03:48:51,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:51,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434455805] [2021-08-26 03:48:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:51,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-08-26 03:48:51,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:51,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434455805] [2021-08-26 03:48:51,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434455805] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:51,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499498741] [2021-08-26 03:48:51,238 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 03:48:51,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:51,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:51,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:51,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 03:48:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:51,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:48:51,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 229 proven. 49 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-08-26 03:48:51,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499498741] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:51,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:51,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-08-26 03:48:51,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962228759] [2021-08-26 03:48:51,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 03:48:51,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 03:48:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:48:51,617 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:51,652 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-08-26 03:48:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 03:48:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-26 03:48:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:51,654 INFO L225 Difference]: With dead ends: 109 [2021-08-26 03:48:51,654 INFO L226 Difference]: Without dead ends: 69 [2021-08-26 03:48:51,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 104.9ms TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:48:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-26 03:48:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2021-08-26 03:48:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-08-26 03:48:51,659 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 59 [2021-08-26 03:48:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:51,659 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-08-26 03:48:51,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-08-26 03:48:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-26 03:48:51,660 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:51,660 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:51,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:51,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:51,877 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1083775622, now seen corresponding path program 8 times [2021-08-26 03:48:51,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:51,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375166186] [2021-08-26 03:48:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:51,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-08-26 03:48:51,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:51,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375166186] [2021-08-26 03:48:51,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375166186] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:51,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896300384] [2021-08-26 03:48:51,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 03:48:51,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:51,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:51,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 03:48:52,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 03:48:52,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:52,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 03:48:52,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 293 proven. 64 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-08-26 03:48:52,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896300384] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:52,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:52,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-08-26 03:48:52,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521689228] [2021-08-26 03:48:52,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 03:48:52,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 03:48:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 03:48:52,449 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:52,503 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2021-08-26 03:48:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 03:48:52,503 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-08-26 03:48:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:52,506 INFO L225 Difference]: With dead ends: 119 [2021-08-26 03:48:52,506 INFO L226 Difference]: Without dead ends: 75 [2021-08-26 03:48:52,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 120.7ms TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 03:48:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-26 03:48:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2021-08-26 03:48:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-08-26 03:48:52,532 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 65 [2021-08-26 03:48:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:52,532 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-08-26 03:48:52,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-08-26 03:48:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-26 03:48:52,534 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:52,534 INFO L512 BasicCegarLoop]: trace histogram [27, 27, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:52,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:52,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 03:48:52,735 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 832519228, now seen corresponding path program 9 times [2021-08-26 03:48:52,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:52,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118717778] [2021-08-26 03:48:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:52,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 365 proven. 81 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2021-08-26 03:48:52,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:52,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118717778] [2021-08-26 03:48:52,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118717778] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:52,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177574624] [2021-08-26 03:48:52,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 03:48:52,849 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:52,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:52,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 03:48:53,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2021-08-26 03:48:53,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:53,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 03:48:53,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 367 proven. 81 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-08-26 03:48:53,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177574624] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:53,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:53,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-08-26 03:48:53,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457298393] [2021-08-26 03:48:53,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 03:48:53,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 03:48:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 03:48:53,393 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:53,449 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-08-26 03:48:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 03:48:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-08-26 03:48:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:53,450 INFO L225 Difference]: With dead ends: 129 [2021-08-26 03:48:53,450 INFO L226 Difference]: Without dead ends: 81 [2021-08-26 03:48:53,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 139.1ms TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2021-08-26 03:48:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-26 03:48:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2021-08-26 03:48:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-08-26 03:48:53,455 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 71 [2021-08-26 03:48:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:53,455 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-08-26 03:48:53,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-08-26 03:48:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-26 03:48:53,455 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:53,456 INFO L512 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:53,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:53,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:53,672 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash -202032770, now seen corresponding path program 10 times [2021-08-26 03:48:53,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:53,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146620409] [2021-08-26 03:48:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:53,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-08-26 03:48:53,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:53,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146620409] [2021-08-26 03:48:53,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146620409] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:53,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161714754] [2021-08-26 03:48:53,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 03:48:53,737 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:53,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:53,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 03:48:53,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 03:48:53,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:53,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 03:48:53,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-08-26 03:48:54,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161714754] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:54,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:54,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-26 03:48:54,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601587355] [2021-08-26 03:48:54,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 03:48:54,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 03:48:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:48:54,409 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:54,430 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-08-26 03:48:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:48:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-26 03:48:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:54,431 INFO L225 Difference]: With dead ends: 127 [2021-08-26 03:48:54,431 INFO L226 Difference]: Without dead ends: 123 [2021-08-26 03:48:54,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2021-08-26 03:48:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-26 03:48:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2021-08-26 03:48:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.05) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-08-26 03:48:54,437 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 77 [2021-08-26 03:48:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:54,437 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-08-26 03:48:54,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-08-26 03:48:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 03:48:54,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:54,438 INFO L512 BasicCegarLoop]: trace histogram [40, 40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:54,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:54,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-26 03:48:54,656 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -112220578, now seen corresponding path program 11 times [2021-08-26 03:48:54,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:54,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693040077] [2021-08-26 03:48:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:54,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-08-26 03:48:54,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:54,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693040077] [2021-08-26 03:48:54,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693040077] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:54,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810468578] [2021-08-26 03:48:54,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 03:48:54,726 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:54,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:54,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-26 03:48:55,038 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2021-08-26 03:48:55,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:55,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 03:48:55,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-08-26 03:48:55,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810468578] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:55,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:55,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-08-26 03:48:55,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750116062] [2021-08-26 03:48:55,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:48:55,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:55,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:48:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:48:55,568 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:55,605 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-08-26 03:48:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:48:55,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-26 03:48:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:55,607 INFO L225 Difference]: With dead ends: 150 [2021-08-26 03:48:55,607 INFO L226 Difference]: Without dead ends: 146 [2021-08-26 03:48:55,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 53.4ms TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:48:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-26 03:48:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2021-08-26 03:48:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.048780487804878) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-08-26 03:48:55,613 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 100 [2021-08-26 03:48:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:55,614 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-08-26 03:48:55,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-08-26 03:48:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-26 03:48:55,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:55,615 INFO L512 BasicCegarLoop]: trace histogram [50, 50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:55,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:55,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-26 03:48:55,832 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1202143874, now seen corresponding path program 12 times [2021-08-26 03:48:55,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:55,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416657062] [2021-08-26 03:48:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:55,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2021-08-26 03:48:55,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:55,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416657062] [2021-08-26 03:48:55,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416657062] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:55,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101995703] [2021-08-26 03:48:55,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-26 03:48:55,920 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:55,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:55,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-26 03:48:56,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2021-08-26 03:48:56,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:56,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 03:48:56,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2735 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2021-08-26 03:48:57,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101995703] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:57,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:57,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-26 03:48:57,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959635985] [2021-08-26 03:48:57,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-26 03:48:57,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-26 03:48:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 03:48:57,005 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:57,043 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2021-08-26 03:48:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 03:48:57,044 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-08-26 03:48:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:57,045 INFO L225 Difference]: With dead ends: 173 [2021-08-26 03:48:57,045 INFO L226 Difference]: Without dead ends: 169 [2021-08-26 03:48:57,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2021-08-26 03:48:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-26 03:48:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2021-08-26 03:48:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.047945205479452) internal successors, (153), 146 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2021-08-26 03:48:57,051 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 123 [2021-08-26 03:48:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:57,051 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2021-08-26 03:48:57,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2021-08-26 03:48:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-08-26 03:48:57,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:57,052 INFO L512 BasicCegarLoop]: trace histogram [60, 60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:57,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:57,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-26 03:48:57,270 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1019764130, now seen corresponding path program 13 times [2021-08-26 03:48:57,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:57,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580162269] [2021-08-26 03:48:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:57,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2021-08-26 03:48:57,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:57,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580162269] [2021-08-26 03:48:57,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580162269] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:57,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156244994] [2021-08-26 03:48:57,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-26 03:48:57,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:57,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:57,381 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:57,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-26 03:48:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:57,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 03:48:57,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:48:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 0 proven. 3351 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2021-08-26 03:48:58,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156244994] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:58,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:48:58,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-08-26 03:48:58,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558819110] [2021-08-26 03:48:58,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-26 03:48:58,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:48:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-26 03:48:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2021-08-26 03:48:58,626 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:48:58,667 INFO L93 Difference]: Finished difference Result 196 states and 204 transitions. [2021-08-26 03:48:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 03:48:58,667 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2021-08-26 03:48:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:48:58,668 INFO L225 Difference]: With dead ends: 196 [2021-08-26 03:48:58,668 INFO L226 Difference]: Without dead ends: 192 [2021-08-26 03:48:58,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2021-08-26 03:48:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-26 03:48:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 170. [2021-08-26 03:48:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.047337278106509) internal successors, (177), 169 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 177 transitions. [2021-08-26 03:48:58,676 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 177 transitions. Word has length 146 [2021-08-26 03:48:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:48:58,677 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 177 transitions. [2021-08-26 03:48:58,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:48:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 177 transitions. [2021-08-26 03:48:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-08-26 03:48:58,678 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:48:58,678 INFO L512 BasicCegarLoop]: trace histogram [70, 70, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:48:58,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-26 03:48:58,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-26 03:48:58,896 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:48:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:48:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1127563646, now seen corresponding path program 14 times [2021-08-26 03:48:58,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:48:58,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682104811] [2021-08-26 03:48:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:48:58,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:48:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:48:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2021-08-26 03:48:59,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:48:59,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682104811] [2021-08-26 03:48:59,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682104811] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:48:59,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525471112] [2021-08-26 03:48:59,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 03:48:59,009 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:48:59,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:48:59,010 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:48:59,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-26 03:48:59,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 03:48:59,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:48:59,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:48:59,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:49:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 4690 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2021-08-26 03:49:00,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525471112] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:00,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:49:00,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-08-26 03:49:00,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930772057] [2021-08-26 03:49:00,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 03:49:00,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:49:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 03:49:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:49:00,479 INFO L87 Difference]: Start difference. First operand 170 states and 177 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:49:00,526 INFO L93 Difference]: Finished difference Result 219 states and 228 transitions. [2021-08-26 03:49:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 03:49:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2021-08-26 03:49:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:49:00,527 INFO L225 Difference]: With dead ends: 219 [2021-08-26 03:49:00,527 INFO L226 Difference]: Without dead ends: 215 [2021-08-26 03:49:00,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 97.7ms TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:49:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-26 03:49:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 193. [2021-08-26 03:49:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.046875) internal successors, (201), 192 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2021-08-26 03:49:00,535 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 169 [2021-08-26 03:49:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:49:00,535 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2021-08-26 03:49:00,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2021-08-26 03:49:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-08-26 03:49:00,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:49:00,537 INFO L512 BasicCegarLoop]: trace histogram [80, 80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:49:00,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-26 03:49:00,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:49:00,754 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:49:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:49:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1903780258, now seen corresponding path program 15 times [2021-08-26 03:49:00,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:49:00,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104659801] [2021-08-26 03:49:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:49:00,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:49:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:49:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-08-26 03:49:00,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:49:00,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104659801] [2021-08-26 03:49:00,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104659801] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:00,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427074771] [2021-08-26 03:49:00,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 03:49:00,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:49:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:49:00,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:49:00,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-26 03:49:01,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2021-08-26 03:49:01,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:49:01,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 03:49:01,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:49:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7052 backedges. 0 proven. 6252 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2021-08-26 03:49:02,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427074771] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:02,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:49:02,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-08-26 03:49:02,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831216080] [2021-08-26 03:49:02,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 03:49:02,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:49:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 03:49:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 03:49:02,671 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:49:02,712 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2021-08-26 03:49:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 03:49:02,713 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2021-08-26 03:49:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:49:02,714 INFO L225 Difference]: With dead ends: 242 [2021-08-26 03:49:02,714 INFO L226 Difference]: Without dead ends: 238 [2021-08-26 03:49:02,714 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 116.6ms TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2021-08-26 03:49:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-08-26 03:49:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2021-08-26 03:49:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.0465116279069768) internal successors, (225), 215 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2021-08-26 03:49:02,722 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 192 [2021-08-26 03:49:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:49:02,723 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2021-08-26 03:49:02,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2021-08-26 03:49:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-08-26 03:49:02,724 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:49:02,724 INFO L512 BasicCegarLoop]: trace histogram [90, 90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:49:02,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-08-26 03:49:02,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-26 03:49:02,945 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:49:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:49:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash 684377470, now seen corresponding path program 16 times [2021-08-26 03:49:02,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:49:02,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522991935] [2021-08-26 03:49:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:49:02,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:49:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:49:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2021-08-26 03:49:03,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:49:03,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522991935] [2021-08-26 03:49:03,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522991935] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:03,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635546813] [2021-08-26 03:49:03,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 03:49:03,082 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:49:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:49:03,097 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:49:03,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-26 03:49:03,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 03:49:03,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:49:03,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 03:49:03,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:49:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8937 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2021-08-26 03:49:05,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635546813] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:05,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:49:05,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-08-26 03:49:05,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393041924] [2021-08-26 03:49:05,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 03:49:05,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:49:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 03:49:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2021-08-26 03:49:05,128 INFO L87 Difference]: Start difference. First operand 216 states and 225 transitions. Second operand has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:49:05,200 INFO L93 Difference]: Finished difference Result 265 states and 276 transitions. [2021-08-26 03:49:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 03:49:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2021-08-26 03:49:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:49:05,201 INFO L225 Difference]: With dead ends: 265 [2021-08-26 03:49:05,201 INFO L226 Difference]: Without dead ends: 261 [2021-08-26 03:49:05,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2021-08-26 03:49:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-26 03:49:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2021-08-26 03:49:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.046218487394958) internal successors, (249), 238 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 249 transitions. [2021-08-26 03:49:05,210 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 249 transitions. Word has length 215 [2021-08-26 03:49:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:49:05,210 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 249 transitions. [2021-08-26 03:49:05,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 249 transitions. [2021-08-26 03:49:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-08-26 03:49:05,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:49:05,213 INFO L512 BasicCegarLoop]: trace histogram [100, 100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:49:05,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-26 03:49:05,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 03:49:05,429 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 03:49:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:49:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash -16999842, now seen corresponding path program 17 times [2021-08-26 03:49:05,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:49:05,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378130159] [2021-08-26 03:49:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:49:05,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:49:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:49:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 10917 proven. 119 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 03:49:10,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:49:10,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378130159] [2021-08-26 03:49:10,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378130159] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:49:10,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501192406] [2021-08-26 03:49:10,062 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-26 03:49:10,062 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:49:10,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:49:10,063 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:49:10,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-26 03:49:11,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 81 check-sat command(s) [2021-08-26 03:49:11,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 03:49:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 104 conjunts are in the unsatisfiable core [2021-08-26 03:49:11,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:49:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 11036 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 03:49:11,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501192406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:49:11,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 03:49:11,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [104] total 106 [2021-08-26 03:49:11,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165913295] [2021-08-26 03:49:11,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-08-26 03:49:11,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:49:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-08-26 03:49:11,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2021-08-26 03:49:11,711 INFO L87 Difference]: Start difference. First operand 239 states and 249 transitions. Second operand has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:49:12,521 INFO L93 Difference]: Finished difference Result 9779 states and 10239 transitions. [2021-08-26 03:49:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-08-26 03:49:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2021-08-26 03:49:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:49:12,522 INFO L225 Difference]: With dead ends: 9779 [2021-08-26 03:49:12,522 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:49:12,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 4386.8ms TimeCoverageRelationStatistics Valid=5366, Invalid=5976, Unknown=0, NotChecked=0, Total=11342 [2021-08-26 03:49:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:49:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:49:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:49:12,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2021-08-26 03:49:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:49:12,534 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:49:12,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 104 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:49:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:49:12,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:49:12,537 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:49:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-26 03:49:12,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:49:12,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:49:12,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:49:12,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:50:25,560 WARN L207 SmtUtils]: Spent 1.21 m on a formula simplification. DAG size of input: 5172 DAG size of output: 2205 [2021-08-26 03:50:25,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:50:26,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:51:56,211 WARN L207 SmtUtils]: Spent 1.50 m on a formula simplification. DAG size of input: 2186 DAG size of output: 363 [2021-08-26 03:52:02,483 WARN L207 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 663 DAG size of output: 59 [2021-08-26 03:52:02,486 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:52:02,486 INFO L857 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2021-08-26 03:52:02,487 INFO L857 garLoopResultBuilder]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L853 garLoopResultBuilder]: At program point L31-3(lines 31 35) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~0)) (.cse1 (<= 10 ULTIMATE.start_main_~n~0))) (or (and .cse0 .cse1 (<= 100 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 60 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 6)) (and .cse0 .cse1 (<= 20 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 4) (<= 40 ULTIMATE.start_main_~k~0)) (and .cse0 (<= 0 ULTIMATE.start_main_~k~0) .cse1 (= ULTIMATE.start_main_~i~0 0)) (and .cse0 .cse1 (<= 70 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 7)) (and .cse0 (<= ULTIMATE.start_main_~i~0 1) .cse1 (<= 10 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 5) (<= 50 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= ULTIMATE.start_main_~i~0 8) (<= 80 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 30 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 3)) (and .cse0 .cse1 (<= 90 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 9)))) [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point L32-2(lines 32 34) no Hoare annotation was computed. [2021-08-26 03:52:02,488 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:52:02,489 INFO L853 garLoopResultBuilder]: At program point L32-3(lines 32 34) the Hoare annotation is: (let ((.cse16 (<= 60 ULTIMATE.start_main_~k~0)) (.cse2 (<= 20 ULTIMATE.start_main_~k~0)) (.cse12 (<= 70 ULTIMATE.start_main_~k~0)) (.cse23 (<= 30 ULTIMATE.start_main_~k~0)) (.cse29 (<= 80 ULTIMATE.start_main_~k~0)) (.cse10 (<= ULTIMATE.start_main_~j~0 3)) (.cse7 (<= ULTIMATE.start_main_~j~0 7)) (.cse28 (<= 10 ULTIMATE.start_main_~k~0)) (.cse30 (<= 90 ULTIMATE.start_main_~k~0)) (.cse11 (<= ULTIMATE.start_main_~j~0 8)) (.cse21 (<= 40 ULTIMATE.start_main_~k~0)) (.cse25 (<= 50 ULTIMATE.start_main_~k~0)) (.cse4 (= ULTIMATE.start_main_~j~0 0)) (.cse17 (<= ULTIMATE.start_main_~i~0 5)) (.cse13 (<= ULTIMATE.start_main_~i~0 7)) (.cse6 (<= ULTIMATE.start_main_~j~0 5)) (.cse27 (<= ULTIMATE.start_main_~j~0 1)) (.cse18 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse24 (<= ULTIMATE.start_main_~i~0 4)) (.cse26 (<= ULTIMATE.start_main_~j~0 6)) (.cse19 (<= ULTIMATE.start_main_~i~0 8)) (.cse3 (<= ULTIMATE.start_main_~i~0 2)) (.cse22 (= ULTIMATE.start_main_~i~0 0)) (.cse5 (<= ULTIMATE.start_main_~i~0 6)) (.cse14 (<= ULTIMATE.start_main_~j~0 9)) (.cse9 (<= ULTIMATE.start_main_~i~0 1)) (.cse20 (<= ULTIMATE.start_main_~j~0 2)) (.cse0 (<= 10 ULTIMATE.start_main_~m~0)) (.cse1 (<= 10 ULTIMATE.start_main_~n~0)) (.cse8 (<= ULTIMATE.start_main_~i~0 3)) (.cse15 (<= ULTIMATE.start_main_~j~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 65 ULTIMATE.start_main_~k~0) .cse5 .cse6) (and .cse0 .cse1 .cse7 (<= 37 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse9 .cse1 .cse10 (<= 13 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 68 ULTIMATE.start_main_~k~0) .cse11 .cse5) (and .cse0 .cse1 .cse12 .cse5) (and .cse0 (<= 79 ULTIMATE.start_main_~k~0) .cse1 .cse13 .cse14) (and .cse0 .cse9 .cse1 (<= 14 ULTIMATE.start_main_~k~0) .cse15) (and .cse0 .cse1 .cse16 .cse17) (and .cse0 .cse1 .cse18 (<= 94 ULTIMATE.start_main_~k~0) .cse15) (and .cse0 .cse1 (<= 54 ULTIMATE.start_main_~k~0) .cse17 .cse15) (and .cse0 .cse1 .cse18 (<= 97 ULTIMATE.start_main_~k~0) .cse7) (and .cse0 .cse1 .cse16 .cse5 .cse4) (and .cse0 .cse1 .cse18 .cse6 (<= 95 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 83 ULTIMATE.start_main_~k~0) .cse10 .cse19) (and .cse0 .cse1 .cse17 .cse20 (<= 52 ULTIMATE.start_main_~k~0)) (and .cse0 (<= 53 ULTIMATE.start_main_~k~0) .cse1 .cse17 .cse10) (and .cse0 .cse1 .cse21 .cse8) (and .cse0 .cse1 (<= 3 ULTIMATE.start_main_~k~0) .cse10 .cse22) (and .cse0 .cse1 (<= 39 ULTIMATE.start_main_~k~0) .cse8 .cse14) (and .cse0 .cse1 .cse23 .cse8 .cse4) (and .cse0 .cse1 .cse6 (<= 85 ULTIMATE.start_main_~k~0) .cse19) (and .cse0 .cse1 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse19 (<= 86 ULTIMATE.start_main_~k~0)) (and .cse0 .cse9 .cse1 .cse6 (<= 15 ULTIMATE.start_main_~k~0)) (and .cse0 .cse27 .cse1 .cse24 (<= 41 ULTIMATE.start_main_~k~0)) (and .cse0 .cse27 .cse1 (<= 21 ULTIMATE.start_main_~k~0) .cse3) (and .cse0 .cse1 (<= 25 ULTIMATE.start_main_~k~0) .cse6 .cse3) (and .cse0 .cse1 (<= 82 ULTIMATE.start_main_~k~0) .cse19 .cse20) (and .cse0 .cse9 .cse1 .cse28 .cse4) (and .cse0 .cse1 .cse24 .cse7 (<= 47 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse24 .cse20 (<= 42 ULTIMATE.start_main_~k~0)) (and (<= 29 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse3 .cse14) (and .cse0 .cse1 (<= 9 ULTIMATE.start_main_~k~0) .cse22 .cse14) (and .cse0 .cse1 .cse5 (<= 66 ULTIMATE.start_main_~k~0) .cse26) (and .cse0 .cse1 (<= 48 ULTIMATE.start_main_~k~0) .cse11 .cse24) (and .cse0 .cse9 .cse1 (<= 19 ULTIMATE.start_main_~k~0) .cse14) (and .cse0 .cse1 .cse11 (<= 28 ULTIMATE.start_main_~k~0) .cse3) (and .cse0 .cse1 (<= 7 ULTIMATE.start_main_~k~0) .cse7 .cse22) (and .cse0 .cse1 (<= 88 ULTIMATE.start_main_~k~0) .cse11 .cse19) (and .cse0 .cse1 .cse10 (<= 33 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse27 .cse1 .cse19 (<= 81 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse5 (<= 64 ULTIMATE.start_main_~k~0) .cse15) (and .cse0 .cse1 .cse19 .cse4 .cse29) (and .cse0 .cse9 .cse1 .cse2) (and .cse0 .cse1 .cse13 .cse10 (<= 73 ULTIMATE.start_main_~k~0)) (and .cse0 (<= 0 ULTIMATE.start_main_~k~0) .cse1 .cse22 .cse4) (and .cse0 .cse1 (<= 55 ULTIMATE.start_main_~k~0) .cse17 .cse6) (and .cse0 .cse1 (<= 5 ULTIMATE.start_main_~k~0) .cse6 .cse22) (and .cse0 .cse1 .cse24 (<= 44 ULTIMATE.start_main_~k~0) .cse15) (and .cse0 .cse9 .cse1 .cse11 (<= 18 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 23 ULTIMATE.start_main_~k~0) .cse10 .cse3) (and .cse0 .cse1 .cse12 .cse13 .cse4) (and .cse0 .cse27 .cse1 (<= 1 ULTIMATE.start_main_~k~0) .cse22) (and .cse0 .cse1 .cse11 (<= 38 ULTIMATE.start_main_~k~0) .cse8) (and .cse0 .cse1 (<= 59 ULTIMATE.start_main_~k~0) .cse17 .cse14) (and .cse0 .cse1 .cse26 .cse3 (<= 26 ULTIMATE.start_main_~k~0)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~0) .cse1 .cse18 .cse20) (and .cse0 .cse1 .cse6 .cse8 (<= 35 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse23 .cse3) (and .cse0 .cse1 .cse18 (<= 96 ULTIMATE.start_main_~k~0) .cse26) (and (<= 87 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse7 .cse19) (and .cse0 .cse1 (<= 77 ULTIMATE.start_main_~k~0) .cse13 .cse7) (and .cse0 .cse27 .cse1 .cse8 (<= 31 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 89 ULTIMATE.start_main_~k~0) .cse19 .cse14) (and .cse0 .cse1 .cse13 (<= 72 ULTIMATE.start_main_~k~0) .cse20) (and .cse0 .cse1 (<= 57 ULTIMATE.start_main_~k~0) .cse17 .cse7) (and .cse0 .cse1 .cse18 (<= 93 ULTIMATE.start_main_~k~0) .cse10) (and .cse0 .cse1 .cse24 (<= 49 ULTIMATE.start_main_~k~0) .cse14) (and .cse0 .cse1 .cse11 .cse13 (<= 78 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse17 (<= 56 ULTIMATE.start_main_~k~0) .cse26) (and .cse0 .cse1 .cse18 .cse11 (<= 98 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse24 .cse10 (<= 43 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse11 .cse17 (<= 58 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse5 .cse7 (<= 67 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse30 .cse19) (and .cse0 .cse1 .cse13 .cse29) (and .cse0 (<= 63 ULTIMATE.start_main_~k~0) .cse1 .cse5 .cse10) (and .cse0 .cse1 .cse7 .cse3 (<= 27 ULTIMATE.start_main_~k~0)) (and .cse0 .cse27 .cse1 .cse18 (<= 91 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse18 (<= 100 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 32 ULTIMATE.start_main_~k~0) .cse8 .cse20) (and .cse0 .cse1 (<= 74 ULTIMATE.start_main_~k~0) .cse13 .cse15) (and .cse0 .cse1 (<= 2 ULTIMATE.start_main_~k~0) .cse22 .cse20) (and .cse0 .cse27 .cse1 (<= 61 ULTIMATE.start_main_~k~0) .cse5) (and (<= 36 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse26 .cse8) (and .cse0 .cse1 .cse13 .cse26 (<= 76 ULTIMATE.start_main_~k~0)) (and .cse0 .cse27 .cse1 .cse13 (<= 71 ULTIMATE.start_main_~k~0)) (and .cse0 .cse9 .cse1 .cse7 (<= 17 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse24 .cse6 (<= 45 ULTIMATE.start_main_~k~0)) (and .cse0 .cse9 .cse1 .cse26 (<= 16 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 22 ULTIMATE.start_main_~k~0) .cse3 .cse20) (and .cse0 .cse1 .cse22 .cse28) (and .cse0 .cse1 .cse30 .cse18 .cse4) (and .cse0 .cse1 (<= 6 ULTIMATE.start_main_~k~0) .cse22 .cse26) (and (<= 8 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse11 .cse22) (and .cse0 .cse1 .cse24 .cse21 .cse4) (and .cse0 .cse1 .cse17 .cse25 .cse4) (and .cse0 .cse27 .cse1 .cse17 (<= 51 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse13 (<= 75 ULTIMATE.start_main_~k~0) .cse6) (and .cse0 .cse1 .cse5 .cse20 (<= 62 ULTIMATE.start_main_~k~0)) (and .cse0 .cse9 .cse27 .cse1 (<= 11 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 .cse18 (<= 99 ULTIMATE.start_main_~k~0) .cse14) (and .cse0 .cse1 .cse24 .cse26 (<= 46 ULTIMATE.start_main_~k~0)) (and .cse0 .cse1 (<= 84 ULTIMATE.start_main_~k~0) .cse19 .cse15) (and .cse0 .cse1 (<= 24 ULTIMATE.start_main_~k~0) .cse3 .cse15) (and .cse0 (<= 4 ULTIMATE.start_main_~k~0) .cse1 .cse22 .cse15) (and .cse0 .cse1 (<= 69 ULTIMATE.start_main_~k~0) .cse5 .cse14) (and .cse0 .cse9 .cse1 (<= 12 ULTIMATE.start_main_~k~0) .cse20) (and .cse0 .cse1 .cse8 .cse15 (<= 34 ULTIMATE.start_main_~k~0)))) [2021-08-26 03:52:02,489 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:52:02,490 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-08-26 03:52:02,490 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-08-26 03:52:02,493 INFO L853 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~n~0) [2021-08-26 03:52:02,493 INFO L860 garLoopResultBuilder]: At program point L37(lines 24 38) the Hoare annotation is: true [2021-08-26 03:52:02,496 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:52:02,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:52:02 BoogieIcfgContainer [2021-08-26 03:52:02,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:52:02,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:52:02,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:52:02,542 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:52:02,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:48:46" (3/4) ... [2021-08-26 03:52:02,544 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:52:02,550 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 03:52:02,550 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:52:02,550 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:52:02,550 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:52:02,574 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:52:02,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:52:02,575 INFO L168 Benchmark]: Toolchain (without parser) took 196427.11 ms. Allocated memory was 50.3 MB in the beginning and 5.7 GB in the end (delta: 5.7 GB). Free memory was 26.1 MB in the beginning and 3.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,575 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 32.0 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:52:02,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.62 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.9 MB in the beginning and 51.5 MB in the end (delta: -25.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 50.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,576 INFO L168 Benchmark]: Boogie Preprocessor took 12.84 ms. Allocated memory is still 67.1 MB. Free memory was 49.8 MB in the beginning and 48.9 MB in the end (delta: 961.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:52:02,576 INFO L168 Benchmark]: RCFGBuilder took 284.73 ms. Allocated memory is still 67.1 MB. Free memory was 48.9 MB in the beginning and 36.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,576 INFO L168 Benchmark]: TraceAbstraction took 195869.43 ms. Allocated memory was 67.1 MB in the beginning and 5.7 GB in the end (delta: 5.6 GB). Free memory was 36.3 MB in the beginning and 3.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,576 INFO L168 Benchmark]: Witness Printer took 32.79 ms. Allocated memory is still 5.7 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:52:02,577 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.13 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 32.0 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 192.62 ms. Allocated memory was 50.3 MB in the beginning and 67.1 MB in the end (delta: 16.8 MB). Free memory was 25.9 MB in the beginning and 51.5 MB in the end (delta: -25.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 50.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.84 ms. Allocated memory is still 67.1 MB. Free memory was 49.8 MB in the beginning and 48.9 MB in the end (delta: 961.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 284.73 ms. Allocated memory is still 67.1 MB. Free memory was 48.9 MB in the beginning and 36.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 195869.43 ms. Allocated memory was 67.1 MB in the beginning and 5.7 GB in the end (delta: 5.6 GB). Free memory was 36.3 MB in the beginning and 3.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.1 GB. * Witness Printer took 32.79 ms. Allocated memory is still 5.7 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 195741.1ms, OverallIterations: 19, TraceHistogramMax: 100, EmptinessCheckTime: 37.9ms, AutomataDifference: 2161.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 169729.7ms, InitialAbstractionConstructionTime: 5.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 561 SDtfs, 1217 SDslu, 2554 SDs, 0 SdLazy, 1243 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 586.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1898 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 6235.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=18, InterpolantAutomatonStates: 301, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 120.7ms AutomataMinimizationTime, 19 MinimizatonAttempts, 206 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 5123 NumberOfFragments, 1898 HoareAnnotationTreeSize, 4 FomulaSimplifications, 5909860 FormulaSimplificationTreeSizeReduction, 73585.4ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 141739 FormulaSimplificationTreeSizeReductionInter, 96104.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 283.9ms SsaConstructionTime, 934.5ms SatisfiabilityAnalysisTime, 13823.0ms InterpolantComputationTime, 3223 NumberOfCodeBlocks, 3172 NumberOfCodeBlocksAsserted, 304 NumberOfCheckSat, 3187 ConstructedInterpolants, 0 QuantifiedInterpolants, 15496 SizeOfPredicates, 34 NumberOfNonLiveVariables, 4267 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 34349/88241 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 10 <= n - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= m && 10 <= n) && 20 <= k) && i <= 2) && j == 0) || ((((10 <= m && 10 <= n) && 65 <= k) && i <= 6) && j <= 5)) || ((((10 <= m && 10 <= n) && j <= 7) && 37 <= k) && i <= 3)) || ((((10 <= m && i <= 1) && 10 <= n) && j <= 3) && 13 <= k)) || ((((10 <= m && 10 <= n) && 68 <= k) && j <= 8) && i <= 6)) || (((10 <= m && 10 <= n) && 70 <= k) && i <= 6)) || ((((10 <= m && 79 <= k) && 10 <= n) && i <= 7) && j <= 9)) || ((((10 <= m && i <= 1) && 10 <= n) && 14 <= k) && j <= 4)) || (((10 <= m && 10 <= n) && 60 <= k) && i <= 5)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && 94 <= k) && j <= 4)) || ((((10 <= m && 10 <= n) && 54 <= k) && i <= 5) && j <= 4)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && 97 <= k) && j <= 7)) || ((((10 <= m && 10 <= n) && 60 <= k) && i <= 6) && j == 0)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && j <= 5) && 95 <= k)) || ((((10 <= m && 10 <= n) && 83 <= k) && j <= 3) && i <= 8)) || ((((10 <= m && 10 <= n) && i <= 5) && j <= 2) && 52 <= k)) || ((((10 <= m && 53 <= k) && 10 <= n) && i <= 5) && j <= 3)) || (((10 <= m && 10 <= n) && 40 <= k) && i <= 3)) || ((((10 <= m && 10 <= n) && 3 <= k) && j <= 3) && i == 0)) || ((((10 <= m && 10 <= n) && 39 <= k) && i <= 3) && j <= 9)) || ((((10 <= m && 10 <= n) && 30 <= k) && i <= 3) && j == 0)) || ((((10 <= m && 10 <= n) && j <= 5) && 85 <= k) && i <= 8)) || (((10 <= m && 10 <= n) && i <= 4) && 50 <= k)) || ((((10 <= m && 10 <= n) && j <= 6) && i <= 8) && 86 <= k)) || ((((10 <= m && i <= 1) && 10 <= n) && j <= 5) && 15 <= k)) || ((((10 <= m && j <= 1) && 10 <= n) && i <= 4) && 41 <= k)) || ((((10 <= m && j <= 1) && 10 <= n) && 21 <= k) && i <= 2)) || ((((10 <= m && 10 <= n) && 25 <= k) && j <= 5) && i <= 2)) || ((((10 <= m && 10 <= n) && 82 <= k) && i <= 8) && j <= 2)) || ((((10 <= m && i <= 1) && 10 <= n) && 10 <= k) && j == 0)) || ((((10 <= m && 10 <= n) && i <= 4) && j <= 7) && 47 <= k)) || ((((10 <= m && 10 <= n) && i <= 4) && j <= 2) && 42 <= k)) || ((((29 <= k && 10 <= m) && 10 <= n) && i <= 2) && j <= 9)) || ((((10 <= m && 10 <= n) && 9 <= k) && i == 0) && j <= 9)) || ((((10 <= m && 10 <= n) && i <= 6) && 66 <= k) && j <= 6)) || ((((10 <= m && 10 <= n) && 48 <= k) && j <= 8) && i <= 4)) || ((((10 <= m && i <= 1) && 10 <= n) && 19 <= k) && j <= 9)) || ((((10 <= m && 10 <= n) && j <= 8) && 28 <= k) && i <= 2)) || ((((10 <= m && 10 <= n) && 7 <= k) && j <= 7) && i == 0)) || ((((10 <= m && 10 <= n) && 88 <= k) && j <= 8) && i <= 8)) || ((((10 <= m && 10 <= n) && j <= 3) && 33 <= k) && i <= 3)) || ((((10 <= m && j <= 1) && 10 <= n) && i <= 8) && 81 <= k)) || ((((10 <= m && 10 <= n) && i <= 6) && 64 <= k) && j <= 4)) || ((((10 <= m && 10 <= n) && i <= 8) && j == 0) && 80 <= k)) || (((10 <= m && i <= 1) && 10 <= n) && 20 <= k)) || ((((10 <= m && 10 <= n) && i <= 7) && j <= 3) && 73 <= k)) || ((((10 <= m && 0 <= k) && 10 <= n) && i == 0) && j == 0)) || ((((10 <= m && 10 <= n) && 55 <= k) && i <= 5) && j <= 5)) || ((((10 <= m && 10 <= n) && 5 <= k) && j <= 5) && i == 0)) || ((((10 <= m && 10 <= n) && i <= 4) && 44 <= k) && j <= 4)) || ((((10 <= m && i <= 1) && 10 <= n) && j <= 8) && 18 <= k)) || ((((10 <= m && 10 <= n) && 23 <= k) && j <= 3) && i <= 2)) || ((((10 <= m && 10 <= n) && 70 <= k) && i <= 7) && j == 0)) || ((((10 <= m && j <= 1) && 10 <= n) && 1 <= k) && i == 0)) || ((((10 <= m && 10 <= n) && j <= 8) && 38 <= k) && i <= 3)) || ((((10 <= m && 10 <= n) && 59 <= k) && i <= 5) && j <= 9)) || ((((10 <= m && 10 <= n) && j <= 6) && i <= 2) && 26 <= k)) || ((((10 <= m && 92 <= k) && 10 <= n) && i + 1 <= n) && j <= 2)) || ((((10 <= m && 10 <= n) && j <= 5) && i <= 3) && 35 <= k)) || (((10 <= m && 10 <= n) && 30 <= k) && i <= 2)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && 96 <= k) && j <= 6)) || ((((87 <= k && 10 <= m) && 10 <= n) && j <= 7) && i <= 8)) || ((((10 <= m && 10 <= n) && 77 <= k) && i <= 7) && j <= 7)) || ((((10 <= m && j <= 1) && 10 <= n) && i <= 3) && 31 <= k)) || ((((10 <= m && 10 <= n) && 89 <= k) && i <= 8) && j <= 9)) || ((((10 <= m && 10 <= n) && i <= 7) && 72 <= k) && j <= 2)) || ((((10 <= m && 10 <= n) && 57 <= k) && i <= 5) && j <= 7)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && 93 <= k) && j <= 3)) || ((((10 <= m && 10 <= n) && i <= 4) && 49 <= k) && j <= 9)) || ((((10 <= m && 10 <= n) && j <= 8) && i <= 7) && 78 <= k)) || ((((10 <= m && 10 <= n) && i <= 5) && 56 <= k) && j <= 6)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && j <= 8) && 98 <= k)) || ((((10 <= m && 10 <= n) && i <= 4) && j <= 3) && 43 <= k)) || ((((10 <= m && 10 <= n) && j <= 8) && i <= 5) && 58 <= k)) || ((((10 <= m && 10 <= n) && i <= 6) && j <= 7) && 67 <= k)) || (((10 <= m && 10 <= n) && 90 <= k) && i <= 8)) || (((10 <= m && 10 <= n) && i <= 7) && 80 <= k)) || ((((10 <= m && 63 <= k) && 10 <= n) && i <= 6) && j <= 3)) || ((((10 <= m && 10 <= n) && j <= 7) && i <= 2) && 27 <= k)) || ((((10 <= m && j <= 1) && 10 <= n) && i + 1 <= n) && 91 <= k)) || (((10 <= m && 10 <= n) && i + 1 <= n) && 100 <= k)) || ((((10 <= m && 10 <= n) && 32 <= k) && i <= 3) && j <= 2)) || ((((10 <= m && 10 <= n) && 74 <= k) && i <= 7) && j <= 4)) || ((((10 <= m && 10 <= n) && 2 <= k) && i == 0) && j <= 2)) || ((((10 <= m && j <= 1) && 10 <= n) && 61 <= k) && i <= 6)) || ((((36 <= k && 10 <= m) && 10 <= n) && j <= 6) && i <= 3)) || ((((10 <= m && 10 <= n) && i <= 7) && j <= 6) && 76 <= k)) || ((((10 <= m && j <= 1) && 10 <= n) && i <= 7) && 71 <= k)) || ((((10 <= m && i <= 1) && 10 <= n) && j <= 7) && 17 <= k)) || ((((10 <= m && 10 <= n) && i <= 4) && j <= 5) && 45 <= k)) || ((((10 <= m && i <= 1) && 10 <= n) && j <= 6) && 16 <= k)) || ((((10 <= m && 10 <= n) && 22 <= k) && i <= 2) && j <= 2)) || (((10 <= m && 10 <= n) && i == 0) && 10 <= k)) || ((((10 <= m && 10 <= n) && 90 <= k) && i + 1 <= n) && j == 0)) || ((((10 <= m && 10 <= n) && 6 <= k) && i == 0) && j <= 6)) || ((((8 <= k && 10 <= m) && 10 <= n) && j <= 8) && i == 0)) || ((((10 <= m && 10 <= n) && i <= 4) && 40 <= k) && j == 0)) || ((((10 <= m && 10 <= n) && i <= 5) && 50 <= k) && j == 0)) || ((((10 <= m && j <= 1) && 10 <= n) && i <= 5) && 51 <= k)) || ((((10 <= m && 10 <= n) && i <= 7) && 75 <= k) && j <= 5)) || ((((10 <= m && 10 <= n) && i <= 6) && j <= 2) && 62 <= k)) || ((((10 <= m && i <= 1) && j <= 1) && 10 <= n) && 11 <= k)) || ((((10 <= m && 10 <= n) && i + 1 <= n) && 99 <= k) && j <= 9)) || ((((10 <= m && 10 <= n) && i <= 4) && j <= 6) && 46 <= k)) || ((((10 <= m && 10 <= n) && 84 <= k) && i <= 8) && j <= 4)) || ((((10 <= m && 10 <= n) && 24 <= k) && i <= 2) && j <= 4)) || ((((10 <= m && 4 <= k) && 10 <= n) && i == 0) && j <= 4)) || ((((10 <= m && 10 <= n) && 69 <= k) && i <= 6) && j <= 9)) || ((((10 <= m && i <= 1) && 10 <= n) && 12 <= k) && j <= 2)) || ((((10 <= m && 10 <= n) && i <= 3) && j <= 4) && 34 <= k) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((10 <= m && 10 <= n) && 100 <= k) || (((10 <= m && 10 <= n) && 60 <= k) && i <= 6)) || (((10 <= m && 10 <= n) && 20 <= k) && i <= 2)) || (((10 <= m && 10 <= n) && i <= 4) && 40 <= k)) || (((10 <= m && 0 <= k) && 10 <= n) && i == 0)) || (((10 <= m && 10 <= n) && 70 <= k) && i <= 7)) || (((10 <= m && i <= 1) && 10 <= n) && 10 <= k)) || (((10 <= m && 10 <= n) && i <= 5) && 50 <= k)) || (((10 <= m && 10 <= n) && i <= 8) && 80 <= k)) || (((10 <= m && 10 <= n) && 30 <= k) && i <= 3)) || (((10 <= m && 10 <= n) && 90 <= k) && i <= 9) RESULT: Ultimate proved your program to be correct! [2021-08-26 03:52:02,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...