./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-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 --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 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:00:23,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:00:23,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:00:23,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:00:23,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:00:23,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:00:23,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:00:23,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:00:23,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:00:23,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:00:23,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:00:23,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:00:23,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:00:23,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:00:23,411 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:00:23,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:00:23,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:00:23,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:00:23,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:00:23,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:00:23,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:00:23,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:00:23,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:00:23,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:00:23,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:00:23,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:00:23,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:00:23,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:00:23,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:00:23,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:00:23,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:00:23,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:00:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:00:23,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:00:23,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:00:23,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:00:23,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:00:23,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 [2024-10-14 11:00:23,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:00:23,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:00:23,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:00:23,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:00:23,658 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:00:23,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i [2024-10-14 11:00:24,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:00:25,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:00:25,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i [2024-10-14 11:00:25,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370e9bf0b/8e7551442ed94a8b94d4b998a6290469/FLAG907795677 [2024-10-14 11:00:25,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/370e9bf0b/8e7551442ed94a8b94d4b998a6290469 [2024-10-14 11:00:25,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:00:25,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:00:25,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:00:25,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:00:25,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:00:25,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d21dfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25, skipping insertion in model container [2024-10-14 11:00:25,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:00:25,606 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i[915,928] [2024-10-14 11:00:25,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:00:25,658 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:00:25,672 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i[915,928] [2024-10-14 11:00:25,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:00:25,710 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:00:25,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25 WrapperNode [2024-10-14 11:00:25,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:00:25,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:00:25,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:00:25,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:00:25,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,743 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-14 11:00:25,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:00:25,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:00:25,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:00:25,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:00:25,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,765 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:00:25,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:00:25,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:00:25,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:00:25,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:00:25,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (1/1) ... [2024-10-14 11:00:25,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:00:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:00:25,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:00:25,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:00:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:00:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:00:25,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:00:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:00:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:00:25,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:00:25,937 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:00:25,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:00:26,168 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 11:00:26,171 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:00:26,204 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:00:26,204 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:00:26,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:00:26 BoogieIcfgContainer [2024-10-14 11:00:26,205 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:00:26,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:00:26,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:00:26,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:00:26,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:00:25" (1/3) ... [2024-10-14 11:00:26,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2d0985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:00:26, skipping insertion in model container [2024-10-14 11:00:26,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:00:25" (2/3) ... [2024-10-14 11:00:26,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2d0985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:00:26, skipping insertion in model container [2024-10-14 11:00:26,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:00:26" (3/3) ... [2024-10-14 11:00:26,212 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-1.i [2024-10-14 11:00:26,225 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:00:26,225 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:00:26,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:00:26,279 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fac4f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:00:26,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:00:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 11:00:26,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:26,297 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:26,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2086481782, now seen corresponding path program 1 times [2024-10-14 11:00:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119877088] [2024-10-14 11:00:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119877088] [2024-10-14 11:00:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119877088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:00:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266227415] [2024-10-14 11:00:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:26,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:00:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:00:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:00:26,643 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:00:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:26,671 INFO L93 Difference]: Finished difference Result 105 states and 179 transitions. [2024-10-14 11:00:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:00:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-14 11:00:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:26,682 INFO L225 Difference]: With dead ends: 105 [2024-10-14 11:00:26,682 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 11:00:26,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:00:26,688 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:26,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:00:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 11:00:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 11:00:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-10-14 11:00:26,733 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 107 [2024-10-14 11:00:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:26,734 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-10-14 11:00:26,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:00:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-10-14 11:00:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 11:00:26,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:26,757 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:26,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:00:26,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:26,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1912433736, now seen corresponding path program 1 times [2024-10-14 11:00:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902574272] [2024-10-14 11:00:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902574272] [2024-10-14 11:00:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902574272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:27,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:00:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496137585] [2024-10-14 11:00:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:27,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:00:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:27,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:00:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:00:27,591 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:27,801 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-10-14 11:00:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:00:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-14 11:00:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:27,806 INFO L225 Difference]: With dead ends: 141 [2024-10-14 11:00:27,806 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 11:00:27,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:00:27,809 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:27,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 280 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:00:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 11:00:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2024-10-14 11:00:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-10-14 11:00:27,821 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 107 [2024-10-14 11:00:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:27,823 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-10-14 11:00:27,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-10-14 11:00:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 11:00:27,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:27,826 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:00:27,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1519406726, now seen corresponding path program 1 times [2024-10-14 11:00:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545486968] [2024-10-14 11:00:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545486968] [2024-10-14 11:00:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545486968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:00:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342775061] [2024-10-14 11:00:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:28,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:00:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:00:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:00:28,281 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:28,439 INFO L93 Difference]: Finished difference Result 152 states and 219 transitions. [2024-10-14 11:00:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:00:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-14 11:00:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:28,441 INFO L225 Difference]: With dead ends: 152 [2024-10-14 11:00:28,443 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 11:00:28,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:00:28,444 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:28,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 261 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:00:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 11:00:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2024-10-14 11:00:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-10-14 11:00:28,453 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 107 [2024-10-14 11:00:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:28,453 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-10-14 11:00:28,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-10-14 11:00:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 11:00:28,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:28,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:00:28,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:28,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 657561185, now seen corresponding path program 1 times [2024-10-14 11:00:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345859687] [2024-10-14 11:00:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:28,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345859687] [2024-10-14 11:00:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345859687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:28,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 11:00:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683851984] [2024-10-14 11:00:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 11:00:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 11:00:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:00:28,761 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:28,949 INFO L93 Difference]: Finished difference Result 154 states and 222 transitions. [2024-10-14 11:00:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:00:28,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-14 11:00:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:28,954 INFO L225 Difference]: With dead ends: 154 [2024-10-14 11:00:28,954 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 11:00:28,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:00:28,955 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 88 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:28,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 338 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:00:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 11:00:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2024-10-14 11:00:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-10-14 11:00:28,961 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 108 [2024-10-14 11:00:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:28,961 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-10-14 11:00:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-10-14 11:00:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 11:00:28,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:28,963 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:00:28,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash 915726623, now seen corresponding path program 1 times [2024-10-14 11:00:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976331404] [2024-10-14 11:00:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:29,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976331404] [2024-10-14 11:00:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976331404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:00:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083002447] [2024-10-14 11:00:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:00:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:00:29,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:00:29,371 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:29,581 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2024-10-14 11:00:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:00:29,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-14 11:00:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:29,583 INFO L225 Difference]: With dead ends: 174 [2024-10-14 11:00:29,583 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 11:00:29,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:00:29,586 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:29,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 409 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:00:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 11:00:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2024-10-14 11:00:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-10-14 11:00:29,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 108 [2024-10-14 11:00:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-10-14 11:00:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-10-14 11:00:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 11:00:29,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:29,604 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:29,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:00:29,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:29,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 522699613, now seen corresponding path program 1 times [2024-10-14 11:00:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583526321] [2024-10-14 11:00:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583526321] [2024-10-14 11:00:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583526321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:00:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598474206] [2024-10-14 11:00:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:00:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:00:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:00:29,989 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:30,257 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2024-10-14 11:00:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:00:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-14 11:00:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:30,259 INFO L225 Difference]: With dead ends: 174 [2024-10-14 11:00:30,260 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 11:00:30,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:00:30,261 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 68 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 534 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:00:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 11:00:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 54. [2024-10-14 11:00:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:00:30,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-14 11:00:30,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 108 [2024-10-14 11:00:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:30,267 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-14 11:00:30,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-14 11:00:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 11:00:30,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:30,268 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:00:30,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -755713587, now seen corresponding path program 1 times [2024-10-14 11:00:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986742966] [2024-10-14 11:00:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:31,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986742966] [2024-10-14 11:00:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986742966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:31,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:31,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:00:31,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570846451] [2024-10-14 11:00:31,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:31,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:00:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:00:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:00:31,442 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:32,105 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2024-10-14 11:00:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:00:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-14 11:00:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:32,107 INFO L225 Difference]: With dead ends: 117 [2024-10-14 11:00:32,107 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 11:00:32,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:00:32,108 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 134 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:32,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 305 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:00:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 11:00:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-10-14 11:00:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 68 states have internal predecessors, (78), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 11:00:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-10-14 11:00:32,134 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 109 [2024-10-14 11:00:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:32,134 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-10-14 11:00:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-10-14 11:00:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:00:32,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:32,138 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:00:32,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1893036607, now seen corresponding path program 1 times [2024-10-14 11:00:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108007593] [2024-10-14 11:00:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108007593] [2024-10-14 11:00:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108007593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:32,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:32,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:00:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198992293] [2024-10-14 11:00:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:32,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:00:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:00:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:00:32,215 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:32,268 INFO L93 Difference]: Finished difference Result 258 states and 364 transitions. [2024-10-14 11:00:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:00:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-10-14 11:00:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:32,272 INFO L225 Difference]: With dead ends: 258 [2024-10-14 11:00:32,272 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 11:00:32,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:00:32,273 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 45 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:32,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:00:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 11:00:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-10-14 11:00:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-14 11:00:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 237 transitions. [2024-10-14 11:00:32,304 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 237 transitions. Word has length 110 [2024-10-14 11:00:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:32,305 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 237 transitions. [2024-10-14 11:00:32,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2024-10-14 11:00:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:00:32,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:32,306 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:00:32,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1898986647, now seen corresponding path program 1 times [2024-10-14 11:00:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650737317] [2024-10-14 11:00:32,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:32,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650737317] [2024-10-14 11:00:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650737317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:00:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143945400] [2024-10-14 11:00:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:00:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:00:32,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:00:32,371 INFO L87 Difference]: Start difference. First operand 166 states and 237 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:32,418 INFO L93 Difference]: Finished difference Result 289 states and 406 transitions. [2024-10-14 11:00:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:00:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-10-14 11:00:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:32,420 INFO L225 Difference]: With dead ends: 289 [2024-10-14 11:00:32,420 INFO L226 Difference]: Without dead ends: 149 [2024-10-14 11:00:32,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:00:32,422 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 45 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:32,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:00:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-14 11:00:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2024-10-14 11:00:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 75 states have internal predecessors, (84), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 11:00:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2024-10-14 11:00:32,439 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 110 [2024-10-14 11:00:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:32,439 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2024-10-14 11:00:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2024-10-14 11:00:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:00:32,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:32,440 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:32,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:00:32,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:32,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -753020701, now seen corresponding path program 1 times [2024-10-14 11:00:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23114531] [2024-10-14 11:00:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23114531] [2024-10-14 11:00:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23114531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:00:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395897614] [2024-10-14 11:00:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:32,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:00:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:00:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:00:32,893 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:33,197 INFO L93 Difference]: Finished difference Result 158 states and 215 transitions. [2024-10-14 11:00:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:00:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-10-14 11:00:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:33,199 INFO L225 Difference]: With dead ends: 158 [2024-10-14 11:00:33,199 INFO L226 Difference]: Without dead ends: 156 [2024-10-14 11:00:33,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:00:33,200 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 111 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:33,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 419 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:00:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-14 11:00:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-10-14 11:00:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 85 states have internal predecessors, (94), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 11:00:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-10-14 11:00:33,220 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 110 [2024-10-14 11:00:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:33,221 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-10-14 11:00:33,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-10-14 11:00:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 11:00:33,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:33,222 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:00:33,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1498705397, now seen corresponding path program 1 times [2024-10-14 11:00:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32065238] [2024-10-14 11:00:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:00:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823648356] [2024-10-14 11:00:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:00:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:00:33,255 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) [2024-10-14 11:00:33,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:00:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:33,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 11:00:33,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:00:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 11:00:38,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:00:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 11:00:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32065238] [2024-10-14 11:00:41,041 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 11:00:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823648356] [2024-10-14 11:00:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823648356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:00:41,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:00:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-10-14 11:00:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743272122] [2024-10-14 11:00:41,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:00:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 11:00:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:41,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 11:00:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-14 11:00:41,043 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 11:00:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:42,098 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2024-10-14 11:00:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 11:00:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 111 [2024-10-14 11:00:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:42,100 INFO L225 Difference]: With dead ends: 180 [2024-10-14 11:00:42,100 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 11:00:42,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-10-14 11:00:42,101 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 140 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:42,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 410 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 11:00:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 11:00:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2024-10-14 11:00:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 87 states have internal predecessors, (96), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 11:00:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2024-10-14 11:00:42,115 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 111 [2024-10-14 11:00:42,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:42,115 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2024-10-14 11:00:42,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 11:00:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2024-10-14 11:00:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 11:00:42,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:42,118 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:42,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:00:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 11:00:42,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:42,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1246516792, now seen corresponding path program 1 times [2024-10-14 11:00:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881726558] [2024-10-14 11:00:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881726558] [2024-10-14 11:00:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881726558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:00:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903818141] [2024-10-14 11:00:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:00:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:00:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:00:43,175 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:43,607 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2024-10-14 11:00:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:00:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-10-14 11:00:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:43,609 INFO L225 Difference]: With dead ends: 153 [2024-10-14 11:00:43,609 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 11:00:43,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:00:43,610 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 62 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:43,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 548 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:00:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 11:00:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2024-10-14 11:00:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 87 states have internal predecessors, (96), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 11:00:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2024-10-14 11:00:43,622 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 111 [2024-10-14 11:00:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:43,622 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2024-10-14 11:00:43,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 11:00:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2024-10-14 11:00:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 11:00:43,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:00:43,623 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 11:00:43,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:00:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:00:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 437170166, now seen corresponding path program 1 times [2024-10-14 11:00:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:00:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294371399] [2024-10-14 11:00:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:00:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:00:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:00:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:00:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:00:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:00:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:00:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:00:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:00:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:00:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:00:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:00:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:00:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:00:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:00:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:00:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:00:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:00:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 11:00:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:00:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:00:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:00:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294371399] [2024-10-14 11:00:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294371399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:00:45,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:00:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:00:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484209172] [2024-10-14 11:00:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:00:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:00:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:00:45,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:00:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:00:45,122 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:00:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:00:45,996 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2024-10-14 11:00:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 11:00:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-10-14 11:00:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:00:45,997 INFO L225 Difference]: With dead ends: 145 [2024-10-14 11:00:45,997 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:00:45,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-14 11:00:45,998 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 124 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:00:45,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 304 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:00:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:00:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:00:45,999 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) [2024-10-14 11:00:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:00:45,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2024-10-14 11:00:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:00:45,999 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:00:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:00:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:00:45,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:00:46,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:00:46,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 11:00:46,004 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:00:46,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:00:46,931 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:00:46,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:00:46 BoogieIcfgContainer [2024-10-14 11:00:46,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:00:46,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:00:46,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:00:46,953 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:00:46,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:00:26" (3/4) ... [2024-10-14 11:00:46,960 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:00:46,967 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:00:46,970 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 11:00:46,971 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 11:00:46,971 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:00:46,971 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:00:47,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:00:47,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:00:47,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:00:47,065 INFO L158 Benchmark]: Toolchain (without parser) took 21606.86ms. Allocated memory was 151.0MB in the beginning and 721.4MB in the end (delta: 570.4MB). Free memory was 82.2MB in the beginning and 434.1MB in the end (delta: -351.9MB). Peak memory consumption was 220.5MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,065 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:00:47,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.83ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 81.9MB in the beginning and 168.8MB in the end (delta: -86.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.31ms. Allocated memory is still 199.2MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,066 INFO L158 Benchmark]: Boogie Preprocessor took 36.02ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:00:47,066 INFO L158 Benchmark]: RCFGBuilder took 420.48ms. Allocated memory is still 199.2MB. Free memory was 164.6MB in the beginning and 144.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,067 INFO L158 Benchmark]: TraceAbstraction took 20741.73ms. Allocated memory was 199.2MB in the beginning and 721.4MB in the end (delta: 522.2MB). Free memory was 143.7MB in the beginning and 440.4MB in the end (delta: -296.7MB). Peak memory consumption was 409.8MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,067 INFO L158 Benchmark]: Witness Printer took 111.89ms. Allocated memory is still 721.4MB. Free memory was 440.4MB in the beginning and 434.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:00:47,070 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.83ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 81.9MB in the beginning and 168.8MB in the end (delta: -86.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.31ms. Allocated memory is still 199.2MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.02ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 164.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.48ms. Allocated memory is still 199.2MB. Free memory was 164.6MB in the beginning and 144.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20741.73ms. Allocated memory was 199.2MB in the beginning and 721.4MB in the end (delta: 522.2MB). Free memory was 143.7MB in the beginning and 440.4MB in the end (delta: -296.7MB). Peak memory consumption was 409.8MB. Max. memory is 16.1GB. * Witness Printer took 111.89ms. Allocated memory is still 721.4MB. Free memory was 440.4MB in the beginning and 434.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1029 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 993 mSDsluCounter, 4164 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2956 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2924 IncrementalHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 1208 mSDtfsCounter, 2924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 766 GetRequests, 662 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=8, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 305 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1528 NumberOfCodeBlocks, 1528 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1514 ConstructedInterpolants, 11 QuantifiedInterpolants, 6002 SizeOfPredicates, 13 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 7565/7616 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: 106]: Loop Invariant Derived loop invariant: (((((0 <= var_1_11) && (0 <= (var_1_10 + 2147483648))) && (var_1_16 == var_1_13)) && (var_1_10 <= 2147483647)) || (((((var_1_16 != 0) && (0 <= var_1_11)) && (0 <= (var_1_10 + 2147483648))) && (var_1_11 != 0)) && (var_1_10 <= 2147483647))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((0 <= (var_1_10 + 2147483648)) && (var_1_10 <= 2147483647)) Ensures: (((cond != 0) && (0 <= (var_1_10 + 2147483648))) && (var_1_10 <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-10-14 11:00:47,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE