./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_operatoramount_amount25_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_operatoramount_amount25_file-22.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 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:32:29,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:32:29,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:32:29,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:32:29,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:32:29,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:32:29,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:32:29,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:32:29,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:32:29,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:32:29,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:32:29,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:32:29,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:32:29,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:32:29,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:32:29,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:32:29,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:32:29,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:32:29,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:32:29,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:32:29,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:32:29,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:32:29,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:32:29,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:32:29,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:32:29,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:32:29,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:32:29,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:32:29,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:32:29,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:32:29,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:32:29,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:32:29,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:32:29,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:32:29,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:32:29,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:32:29,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:32:29,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:32:29,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:32:29,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:32:29,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:32:29,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:32:29,836 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 -> 1f1ff57e05e630dff57aa0934f791de6e9376758210c85d71052468c66e934d8 [2024-10-24 10:32:30,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:32:30,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:32:30,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:32:30,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:32:30,107 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:32:30,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2024-10-24 10:32:31,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:32:31,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:32:31,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-22.i [2024-10-24 10:32:31,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a48bb44/8ad0afdd34ba4aafb39eaaa80f8410f9/FLAGbd10e5df6 [2024-10-24 10:32:31,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a48bb44/8ad0afdd34ba4aafb39eaaa80f8410f9 [2024-10-24 10:32:31,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:32:31,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:32:31,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:32:31,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:32:31,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:32:31,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:32:31" (1/1) ... [2024-10-24 10:32:31,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5913498e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:31, skipping insertion in model container [2024-10-24 10:32:31,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:32:31" (1/1) ... [2024-10-24 10:32:31,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:32:31,984 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_operatoramount_amount25_file-22.i[915,928] [2024-10-24 10:32:32,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:32:32,036 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:32:32,046 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_operatoramount_amount25_file-22.i[915,928] [2024-10-24 10:32:32,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:32:32,083 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:32:32,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32 WrapperNode [2024-10-24 10:32:32,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:32:32,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:32:32,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:32:32,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:32:32,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,135 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-24 10:32:32,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:32:32,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:32:32,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:32:32,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:32:32,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,165 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-24 10:32:32,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:32:32,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:32:32,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:32:32,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:32:32,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (1/1) ... [2024-10-24 10:32:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:32:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:32,230 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-24 10:32:32,234 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-24 10:32:32,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:32:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:32:32,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:32:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:32:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:32:32,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:32:32,360 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:32:32,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:32:32,636 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 10:32:32,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:32:32,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:32:32,684 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:32:32,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:32:32 BoogieIcfgContainer [2024-10-24 10:32:32,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:32:32,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:32:32,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:32:32,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:32:32,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:32:31" (1/3) ... [2024-10-24 10:32:32,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c54e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:32:32, skipping insertion in model container [2024-10-24 10:32:32,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:32" (2/3) ... [2024-10-24 10:32:32,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c54e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:32:32, skipping insertion in model container [2024-10-24 10:32:32,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:32:32" (3/3) ... [2024-10-24 10:32:32,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-22.i [2024-10-24 10:32:32,718 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:32:32,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:32:32,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:32:32,801 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;@261db019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:32:32,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:32:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:32:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 10:32:32,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:32,816 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:32,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1416533760, now seen corresponding path program 1 times [2024-10-24 10:32:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:32,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784620868] [2024-10-24 10:32:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784620868] [2024-10-24 10:32:33,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784620868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:33,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:33,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:32:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410195566] [2024-10-24 10:32:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:33,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:32:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:32:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:32:33,189 INFO L87 Difference]: Start difference. First operand has 42 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:32:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:33,236 INFO L93 Difference]: Finished difference Result 79 states and 127 transitions. [2024-10-24 10:32:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:32:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-24 10:32:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:33,248 INFO L225 Difference]: With dead ends: 79 [2024-10-24 10:32:33,248 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 10:32:33,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-24 10:32:33,257 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:33,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 10:32:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 10:32:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:32:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-10-24 10:32:33,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 54 [2024-10-24 10:32:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-10-24 10:32:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:32:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-10-24 10:32:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 10:32:33,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:33,316 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:33,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:32:33,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:33,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash 780128248, now seen corresponding path program 1 times [2024-10-24 10:32:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846818667] [2024-10-24 10:32:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846818667] [2024-10-24 10:32:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846818667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:34,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:32:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480890039] [2024-10-24 10:32:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:34,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:32:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:34,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:32:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:32:34,036 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:34,276 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2024-10-24 10:32:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2024-10-24 10:32:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:34,278 INFO L225 Difference]: With dead ends: 132 [2024-10-24 10:32:34,278 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 10:32:34,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:34,281 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:34,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 163 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 10:32:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2024-10-24 10:32:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:32:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-10-24 10:32:34,310 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 54 [2024-10-24 10:32:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-10-24 10:32:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-10-24 10:32:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:34,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:34,314 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:34,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:32:34,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:34,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1016282456, now seen corresponding path program 1 times [2024-10-24 10:32:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:34,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410435646] [2024-10-24 10:32:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:34,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410435646] [2024-10-24 10:32:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410435646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:32:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969825107] [2024-10-24 10:32:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:34,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:32:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:32:34,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:32:34,731 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:35,010 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2024-10-24 10:32:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-24 10:32:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:35,014 INFO L225 Difference]: With dead ends: 200 [2024-10-24 10:32:35,014 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 10:32:35,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:35,018 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 83 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:35,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 193 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 10:32:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2024-10-24 10:32:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 10:32:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-10-24 10:32:35,049 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 55 [2024-10-24 10:32:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:35,050 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-10-24 10:32:35,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-10-24 10:32:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:35,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:35,052 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:32:35,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:35,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -758117018, now seen corresponding path program 1 times [2024-10-24 10:32:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443844434] [2024-10-24 10:32:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443844434] [2024-10-24 10:32:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443844434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:32:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811467923] [2024-10-24 10:32:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:35,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:32:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:32:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:35,142 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:35,170 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2024-10-24 10:32:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:32:35,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-24 10:32:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:35,172 INFO L225 Difference]: With dead ends: 175 [2024-10-24 10:32:35,172 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 10:32:35,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-24 10:32:35,174 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:35,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 10:32:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2024-10-24 10:32:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 10:32:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-10-24 10:32:35,191 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 55 [2024-10-24 10:32:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:35,192 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-10-24 10:32:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-10-24 10:32:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:35,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:35,195 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:32:35,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:35,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1194092764, now seen corresponding path program 1 times [2024-10-24 10:32:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:35,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824146338] [2024-10-24 10:32:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824146338] [2024-10-24 10:32:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824146338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:32:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675534779] [2024-10-24 10:32:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:35,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:32:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:32:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:32:35,485 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:35,606 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2024-10-24 10:32:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:32:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-24 10:32:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:35,608 INFO L225 Difference]: With dead ends: 262 [2024-10-24 10:32:35,608 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 10:32:35,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:32:35,614 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:35,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 10:32:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2024-10-24 10:32:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 10:32:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-10-24 10:32:35,645 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 55 [2024-10-24 10:32:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:35,646 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-10-24 10:32:35,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-10-24 10:32:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:32:35,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:35,647 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:35,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:32:35,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:35,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1339935788, now seen corresponding path program 1 times [2024-10-24 10:32:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137412409] [2024-10-24 10:32:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137412409] [2024-10-24 10:32:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137412409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:32:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183324881] [2024-10-24 10:32:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:37,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:32:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:32:37,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:32:37,305 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:37,635 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2024-10-24 10:32:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:32:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2024-10-24 10:32:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:37,638 INFO L225 Difference]: With dead ends: 321 [2024-10-24 10:32:37,639 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 10:32:37,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:32:37,642 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 200 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:37,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 264 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 10:32:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2024-10-24 10:32:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 10:32:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2024-10-24 10:32:37,658 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 56 [2024-10-24 10:32:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:37,659 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2024-10-24 10:32:37,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2024-10-24 10:32:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:32:37,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:37,660 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:37,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:32:37,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:37,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1731498284, now seen corresponding path program 1 times [2024-10-24 10:32:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791219985] [2024-10-24 10:32:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791219985] [2024-10-24 10:32:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791219985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:32:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71776232] [2024-10-24 10:32:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:37,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:32:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:32:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:37,720 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:37,793 INFO L93 Difference]: Finished difference Result 263 states and 356 transitions. [2024-10-24 10:32:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:32:37,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2024-10-24 10:32:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:37,796 INFO L225 Difference]: With dead ends: 263 [2024-10-24 10:32:37,796 INFO L226 Difference]: Without dead ends: 177 [2024-10-24 10:32:37,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-24 10:32:37,797 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:37,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-24 10:32:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-10-24 10:32:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 134 states have internal predecessors, (165), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2024-10-24 10:32:37,818 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 56 [2024-10-24 10:32:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:37,819 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2024-10-24 10:32:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2024-10-24 10:32:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 10:32:37,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:37,820 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:37,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:32:37,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:37,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 643081600, now seen corresponding path program 1 times [2024-10-24 10:32:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549574010] [2024-10-24 10:32:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:38,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549574010] [2024-10-24 10:32:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549574010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47783822] [2024-10-24 10:32:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:38,515 INFO L87 Difference]: Start difference. First operand 175 states and 235 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:38,754 INFO L93 Difference]: Finished difference Result 320 states and 424 transitions. [2024-10-24 10:32:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:38,755 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2024-10-24 10:32:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:38,756 INFO L225 Difference]: With dead ends: 320 [2024-10-24 10:32:38,756 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 10:32:38,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:38,757 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:38,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 166 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 10:32:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2024-10-24 10:32:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 151 states have internal predecessors, (187), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 257 transitions. [2024-10-24 10:32:38,777 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 257 transitions. Word has length 57 [2024-10-24 10:32:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:38,778 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 257 transitions. [2024-10-24 10:32:38,778 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 257 transitions. [2024-10-24 10:32:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 10:32:38,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:38,779 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 10:32:38,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1344146178, now seen corresponding path program 1 times [2024-10-24 10:32:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952461634] [2024-10-24 10:32:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952461634] [2024-10-24 10:32:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952461634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:32:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248711663] [2024-10-24 10:32:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:38,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:32:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:32:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:38,833 INFO L87 Difference]: Start difference. First operand 192 states and 257 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:38,878 INFO L93 Difference]: Finished difference Result 325 states and 435 transitions. [2024-10-24 10:32:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:32:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2024-10-24 10:32:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:38,880 INFO L225 Difference]: With dead ends: 325 [2024-10-24 10:32:38,881 INFO L226 Difference]: Without dead ends: 152 [2024-10-24 10:32:38,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-24 10:32:38,883 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:38,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-24 10:32:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2024-10-24 10:32:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 105 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:32:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2024-10-24 10:32:38,903 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 57 [2024-10-24 10:32:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:38,904 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2024-10-24 10:32:38,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2024-10-24 10:32:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 10:32:38,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:38,905 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:38,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:32:38,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:38,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1500249107, now seen corresponding path program 1 times [2024-10-24 10:32:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514615014] [2024-10-24 10:32:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:40,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514615014] [2024-10-24 10:32:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514615014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 10:32:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865035039] [2024-10-24 10:32:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:40,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 10:32:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 10:32:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:32:40,165 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:40,482 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2024-10-24 10:32:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:32:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-10-24 10:32:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:40,484 INFO L225 Difference]: With dead ends: 255 [2024-10-24 10:32:40,485 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 10:32:40,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:32:40,486 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 172 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:40,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 324 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 10:32:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2024-10-24 10:32:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 116 states have internal predecessors, (136), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:32:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2024-10-24 10:32:40,508 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 59 [2024-10-24 10:32:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:40,509 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2024-10-24 10:32:40,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2024-10-24 10:32:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 10:32:40,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:40,511 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:32:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 10:32:40,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:40,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 388545049, now seen corresponding path program 1 times [2024-10-24 10:32:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849930542] [2024-10-24 10:32:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:32:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:40,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849930542] [2024-10-24 10:32:40,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849930542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:40,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:40,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:32:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279445388] [2024-10-24 10:32:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:32:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:32:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:40,986 INFO L87 Difference]: Start difference. First operand 149 states and 192 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:41,223 INFO L93 Difference]: Finished difference Result 158 states and 201 transitions. [2024-10-24 10:32:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:32:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-10-24 10:32:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:41,225 INFO L225 Difference]: With dead ends: 158 [2024-10-24 10:32:41,226 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 10:32:41,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:32:41,226 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:41,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 311 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 10:32:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2024-10-24 10:32:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 116 states have internal predecessors, (135), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:32:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2024-10-24 10:32:41,240 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 60 [2024-10-24 10:32:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:41,240 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2024-10-24 10:32:41,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2024-10-24 10:32:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 10:32:41,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:41,242 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:41,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 10:32:41,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1931806343, now seen corresponding path program 1 times [2024-10-24 10:32:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399526615] [2024-10-24 10:32:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 10:32:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399526615] [2024-10-24 10:32:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399526615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:42,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:42,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:42,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984563901] [2024-10-24 10:32:42,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:42,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:42,013 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:42,199 INFO L93 Difference]: Finished difference Result 243 states and 311 transitions. [2024-10-24 10:32:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 112 [2024-10-24 10:32:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:42,201 INFO L225 Difference]: With dead ends: 243 [2024-10-24 10:32:42,201 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 10:32:42,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:42,202 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:42,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 170 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 10:32:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 156. [2024-10-24 10:32:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.170731707317073) internal successors, (144), 123 states have internal predecessors, (144), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:32:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2024-10-24 10:32:42,233 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 112 [2024-10-24 10:32:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2024-10-24 10:32:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2024-10-24 10:32:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 10:32:42,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:42,235 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 10:32:42,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1271500933, now seen corresponding path program 1 times [2024-10-24 10:32:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135063529] [2024-10-24 10:32:42,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:32:43,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135063529] [2024-10-24 10:32:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135063529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:32:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512806873] [2024-10-24 10:32:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:43,834 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-24 10:32:43,836 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-24 10:32:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:43,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 10:32:43,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:32:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 10:32:44,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:32:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512806873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:44,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:32:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-10-24 10:32:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669258343] [2024-10-24 10:32:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:32:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:32:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:32:44,907 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:45,056 INFO L93 Difference]: Finished difference Result 243 states and 311 transitions. [2024-10-24 10:32:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:32:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 113 [2024-10-24 10:32:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:45,057 INFO L225 Difference]: With dead ends: 243 [2024-10-24 10:32:45,057 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 10:32:45,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:32:45,058 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:45,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 134 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 10:32:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2024-10-24 10:32:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.170731707317073) internal successors, (144), 123 states have internal predecessors, (144), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:32:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2024-10-24 10:32:45,077 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 113 [2024-10-24 10:32:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:45,077 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2024-10-24 10:32:45,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2024-10-24 10:32:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 10:32:45,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:45,081 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:45,101 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-24 10:32:45,282 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,SelfDestructingSolverStorable12 [2024-10-24 10:32:45,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1525099650, now seen corresponding path program 1 times [2024-10-24 10:32:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400780157] [2024-10-24 10:32:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:32:45,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400780157] [2024-10-24 10:32:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400780157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:32:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602473002] [2024-10-24 10:32:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:45,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:32:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 10:32:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:45,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:32:45,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:32:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-24 10:32:46,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:32:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602473002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:32:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-24 10:32:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95059500] [2024-10-24 10:32:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:46,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:32:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:46,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:32:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 10:32:46,100 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:46,263 INFO L93 Difference]: Finished difference Result 284 states and 370 transitions. [2024-10-24 10:32:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:32:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 114 [2024-10-24 10:32:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:46,265 INFO L225 Difference]: With dead ends: 284 [2024-10-24 10:32:46,265 INFO L226 Difference]: Without dead ends: 228 [2024-10-24 10:32:46,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:32:46,266 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:46,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 297 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-24 10:32:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2024-10-24 10:32:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.1689189189189189) internal successors, (173), 148 states have internal predecessors, (173), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 243 transitions. [2024-10-24 10:32:46,282 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 243 transitions. Word has length 114 [2024-10-24 10:32:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:46,283 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 243 transitions. [2024-10-24 10:32:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2024-10-24 10:32:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 10:32:46,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:46,285 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:46,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:32:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 10:32:46,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:46,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash -114973069, now seen corresponding path program 1 times [2024-10-24 10:32:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516709388] [2024-10-24 10:32:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:32:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 10:32:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:32:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 10:32:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:32:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 10:32:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:32:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 10:32:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516709388] [2024-10-24 10:32:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516709388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:47,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:32:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959304461] [2024-10-24 10:32:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:47,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:32:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:32:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:47,093 INFO L87 Difference]: Start difference. First operand 189 states and 243 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:47,284 INFO L93 Difference]: Finished difference Result 344 states and 435 transitions. [2024-10-24 10:32:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:32:47,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 114 [2024-10-24 10:32:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:47,287 INFO L225 Difference]: With dead ends: 344 [2024-10-24 10:32:47,287 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 10:32:47,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:32:47,289 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 103 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:47,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 10:32:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 191. [2024-10-24 10:32:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.1733333333333333) internal successors, (176), 150 states have internal predecessors, (176), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2024-10-24 10:32:47,305 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 114 [2024-10-24 10:32:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:47,306 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2024-10-24 10:32:47,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2024-10-24 10:32:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 10:32:47,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:47,307 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:47,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 10:32:47,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:47,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1668206848, now seen corresponding path program 1 times [2024-10-24 10:32:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:47,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373434804] [2024-10-24 10:32:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-24 10:32:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:47,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373434804] [2024-10-24 10:32:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373434804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:32:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247439777] [2024-10-24 10:32:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:32:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:32:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:47,387 INFO L87 Difference]: Start difference. First operand 191 states and 246 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:47,436 INFO L93 Difference]: Finished difference Result 286 states and 370 transitions. [2024-10-24 10:32:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:32:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 115 [2024-10-24 10:32:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:47,439 INFO L225 Difference]: With dead ends: 286 [2024-10-24 10:32:47,439 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 10:32:47,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-24 10:32:47,440 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:47,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 10:32:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2024-10-24 10:32:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 141 states have internal predecessors, (165), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2024-10-24 10:32:47,454 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 115 [2024-10-24 10:32:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2024-10-24 10:32:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2024-10-24 10:32:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 10:32:47,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:47,456 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 10:32:47,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:47,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -784244287, now seen corresponding path program 1 times [2024-10-24 10:32:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143321859] [2024-10-24 10:32:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:32:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 10:32:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:32:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 10:32:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:32:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 10:32:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:32:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 10:32:48,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:48,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143321859] [2024-10-24 10:32:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143321859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188004184] [2024-10-24 10:32:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:48,078 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:48,227 INFO L93 Difference]: Finished difference Result 309 states and 389 transitions. [2024-10-24 10:32:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 115 [2024-10-24 10:32:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:48,228 INFO L225 Difference]: With dead ends: 309 [2024-10-24 10:32:48,229 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 10:32:48,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:48,229 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:48,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 174 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 10:32:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2024-10-24 10:32:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.128) internal successors, (141), 125 states have internal predecessors, (141), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-10-24 10:32:48,243 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 115 [2024-10-24 10:32:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-10-24 10:32:48,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-10-24 10:32:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 10:32:48,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:48,245 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:48,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 10:32:48,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:48,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash 225995326, now seen corresponding path program 1 times [2024-10-24 10:32:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:48,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159294378] [2024-10-24 10:32:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 10:32:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159294378] [2024-10-24 10:32:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159294378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:32:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478610770] [2024-10-24 10:32:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:32:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:32:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:32:48,876 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:49,177 INFO L93 Difference]: Finished difference Result 260 states and 327 transitions. [2024-10-24 10:32:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:32:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 116 [2024-10-24 10:32:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:49,179 INFO L225 Difference]: With dead ends: 260 [2024-10-24 10:32:49,179 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 10:32:49,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:32:49,180 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:49,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 342 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 10:32:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 178. [2024-10-24 10:32:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 225 transitions. [2024-10-24 10:32:49,197 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 225 transitions. Word has length 116 [2024-10-24 10:32:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:49,197 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 225 transitions. [2024-10-24 10:32:49,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 225 transitions. [2024-10-24 10:32:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 10:32:49,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:49,199 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:49,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 10:32:49,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -344104474, now seen corresponding path program 1 times [2024-10-24 10:32:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:49,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909048234] [2024-10-24 10:32:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-10-24 10:32:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909048234] [2024-10-24 10:32:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909048234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:32:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883024181] [2024-10-24 10:32:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:51,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:51,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:51,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:32:51,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 10:32:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:51,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:32:51,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:32:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-24 10:32:52,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:32:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883024181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:32:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 21 [2024-10-24 10:32:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282227806] [2024-10-24 10:32:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:32:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:32:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-10-24 10:32:52,138 INFO L87 Difference]: Start difference. First operand 178 states and 225 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:52,309 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2024-10-24 10:32:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:32:52,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 117 [2024-10-24 10:32:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:52,311 INFO L225 Difference]: With dead ends: 308 [2024-10-24 10:32:52,311 INFO L226 Difference]: Without dead ends: 306 [2024-10-24 10:32:52,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-10-24 10:32:52,312 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 32 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:52,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 307 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-24 10:32:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 178. [2024-10-24 10:32:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 10:32:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 225 transitions. [2024-10-24 10:32:52,330 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 225 transitions. Word has length 117 [2024-10-24 10:32:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 225 transitions. [2024-10-24 10:32:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 225 transitions. [2024-10-24 10:32:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 10:32:52,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:52,331 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:52,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 10:32:52,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:52,536 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:52,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -737131484, now seen corresponding path program 1 times [2024-10-24 10:32:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397670085] [2024-10-24 10:32:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:32:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:32:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:32:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:32:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:32:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:32:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397670085] [2024-10-24 10:32:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397670085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:32:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929768617] [2024-10-24 10:32:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:53,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:53,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:32:53,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 10:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:53,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 10:32:53,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:32:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-24 10:32:53,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:32:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929768617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:32:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-10-24 10:32:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115930852] [2024-10-24 10:32:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:32:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:32:53,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-24 10:32:53,927 INFO L87 Difference]: Start difference. First operand 178 states and 225 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:54,103 INFO L93 Difference]: Finished difference Result 359 states and 453 transitions. [2024-10-24 10:32:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:32:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 117 [2024-10-24 10:32:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:54,105 INFO L225 Difference]: With dead ends: 359 [2024-10-24 10:32:54,105 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:32:54,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-24 10:32:54,107 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 31 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:54,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 374 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:32:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:32:54,107 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-24 10:32:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:32:54,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2024-10-24 10:32:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:54,108 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:32:54,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:32:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:32:54,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:32:54,111 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:32:54,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 10:32:54,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:54,315 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:54,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:32:54,538 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:32:54,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:32:54 BoogieIcfgContainer [2024-10-24 10:32:54,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:32:54,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:32:54,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:32:54,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:32:54,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:32:32" (3/4) ... [2024-10-24 10:32:54,559 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:32:54,563 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:32:54,568 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 10:32:54,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:32:54,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:32:54,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:32:54,653 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:32:54,653 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:32:54,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:32:54,654 INFO L158 Benchmark]: Toolchain (without parser) took 22866.02ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 116.4MB in the beginning and 313.8MB in the end (delta: -197.4MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,654 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 138.0MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:32:54,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.94ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 102.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,655 INFO L158 Benchmark]: Boogie Preprocessor took 48.61ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 96.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,655 INFO L158 Benchmark]: RCFGBuilder took 495.46ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 78.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,655 INFO L158 Benchmark]: TraceAbstraction took 21864.74ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 78.6MB in the beginning and 319.1MB in the end (delta: -240.4MB). Peak memory consumption was 179.7MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,656 INFO L158 Benchmark]: Witness Printer took 96.89ms. Allocated memory is still 587.2MB. Free memory was 319.1MB in the beginning and 313.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:32:54,657 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.20ms. Allocated memory is still 167.8MB. Free memory was 138.1MB in the beginning and 138.0MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.94ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 102.5MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.61ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 96.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 495.46ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 78.6MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21864.74ms. Allocated memory was 167.8MB in the beginning and 587.2MB in the end (delta: 419.4MB). Free memory was 78.6MB in the beginning and 319.1MB in the end (delta: -240.4MB). Peak memory consumption was 179.7MB. Max. memory is 16.1GB. * Witness Printer took 96.89ms. Allocated memory is still 587.2MB. Free memory was 319.1MB in the beginning and 313.8MB in the end (delta: 5.2MB). 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1266 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1266 mSDsluCounter, 3884 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2761 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2128 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 1123 mSDtfsCounter, 2128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 911 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 856 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 2112 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2088 ConstructedInterpolants, 0 QuantifiedInterpolants, 11267 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1006 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 5916/6000 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: 86]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_11 == \old(last_1_var_1_11))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:32:54,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE