./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_loopvsstraightlinecode_50-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:47:50,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:47:50,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:47:50,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:47:50,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:47:50,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:47:50,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:47:50,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:47:50,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:47:50,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:47:50,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:47:50,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:47:50,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:47:50,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:47:50,933 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:47:50,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:47:50,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:47:50,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:47:50,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:47:50,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:47:50,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:47:50,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:47:50,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:47:50,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:47:50,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:47:50,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:47:50,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:47:50,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:47:50,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:47:50,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:47:50,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:47:50,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:47:50,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:47:50,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:47:50,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:47:50,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:47:50,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:47:50,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:47:50,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:47:50,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:47:50,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:47:50,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:47:50,945 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-clean/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-clean/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 -> aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 [2024-10-11 11:47:51,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:47:51,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:47:51,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:47:51,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:47:51,268 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:47:51,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-10-11 11:47:52,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:47:52,900 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:47:52,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-10-11 11:47:52,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a336ae820/ad349194c55e4a18995c7432c068a19a/FLAGb28a2cdfa [2024-10-11 11:47:52,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a336ae820/ad349194c55e4a18995c7432c068a19a [2024-10-11 11:47:52,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:47:52,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:47:52,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:47:52,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:47:52,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:47:52,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:47:52" (1/1) ... [2024-10-11 11:47:52,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a23c823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:52, skipping insertion in model container [2024-10-11 11:47:52,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:47:52" (1/1) ... [2024-10-11 11:47:52,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:47:53,126 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_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2024-10-11 11:47:53,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:47:53,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:47:53,201 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_loopvsstraightlinecode_50-1loop_file-34.i[915,928] [2024-10-11 11:47:53,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:47:53,246 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:47:53,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53 WrapperNode [2024-10-11 11:47:53,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:47:53,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:47:53,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:47:53,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:47:53,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,308 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-10-11 11:47:53,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:47:53,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:47:53,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:47:53,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:47:53,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,364 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-11 11:47:53,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:47:53,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:47:53,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:47:53,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:47:53,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (1/1) ... [2024-10-11 11:47:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:47:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:47:53,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:47:53,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:47:53,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:47:53,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:47:53,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:47:53,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:47:53,981 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 11:47:53,981 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:47:54,029 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:47:54,033 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:47:54,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:47:54 BoogieIcfgContainer [2024-10-11 11:47:54,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:47:54,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:47:54,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:47:54,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:47:54,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:47:52" (1/3) ... [2024-10-11 11:47:54,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca519ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:47:54, skipping insertion in model container [2024-10-11 11:47:54,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:47:53" (2/3) ... [2024-10-11 11:47:54,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca519ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:47:54, skipping insertion in model container [2024-10-11 11:47:54,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:47:54" (3/3) ... [2024-10-11 11:47:54,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-10-11 11:47:54,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:47:54,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:47:54,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:47:54,137 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;@4f346a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:47:54,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:47:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:47:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 11:47:54,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:54,155 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:47:54,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:54,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1101016747, now seen corresponding path program 1 times [2024-10-11 11:47:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:47:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352487921] [2024-10-11 11:47:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:47:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:47:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:47:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:47:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:47:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:47:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:47:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:47:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:47:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:47:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:47:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:47:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:47:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:47:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:47:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:47:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352487921] [2024-10-11 11:47:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352487921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:47:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:47:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:47:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967120132] [2024-10-11 11:47:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:47:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:47:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:47:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:47:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:47:54,604 INFO L87 Difference]: Start difference. First operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:47:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:47:54,653 INFO L93 Difference]: Finished difference Result 129 states and 216 transitions. [2024-10-11 11:47:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:47:54,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-11 11:47:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:47:54,668 INFO L225 Difference]: With dead ends: 129 [2024-10-11 11:47:54,669 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 11:47:54,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-11 11:47:54,679 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:47:54,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:47:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 11:47:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 11:47:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 11:47:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-11 11:47:54,733 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 90 [2024-10-11 11:47:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:47:54,733 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-11 11:47:54,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 11:47:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-11 11:47:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 11:47:54,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:54,740 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:47:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:47:54,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 127065065, now seen corresponding path program 1 times [2024-10-11 11:47:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:47:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485535998] [2024-10-11 11:47:54,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:47:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:47:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:47:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:47:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:47:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:47:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:47:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:47:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:47:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:47:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:47:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:47:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:47:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:47:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:47:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:47:55,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485535998] [2024-10-11 11:47:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485535998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:47:55,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:47:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:47:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420813665] [2024-10-11 11:47:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:47:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:47:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:47:55,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:47:55,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:47:55,309 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:47:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:47:55,489 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2024-10-11 11:47:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:47:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-11 11:47:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:47:55,493 INFO L225 Difference]: With dead ends: 216 [2024-10-11 11:47:55,493 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 11:47:55,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-11 11:47:55,495 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 124 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:47:55,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 305 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:47:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 11:47:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-10-11 11:47:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:47:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2024-10-11 11:47:55,519 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 90 [2024-10-11 11:47:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:47:55,520 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2024-10-11 11:47:55,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:47:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-10-11 11:47:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 11:47:55,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:55,525 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:47:55,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:47:55,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:55,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:55,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1632387800, now seen corresponding path program 1 times [2024-10-11 11:47:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:47:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808103473] [2024-10-11 11:47:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:47:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:47:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:47:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:47:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:47:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:47:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:47:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:47:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:47:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:47:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:47:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:47:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:47:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:47:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:47:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:47:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:47:55,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808103473] [2024-10-11 11:47:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808103473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:47:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:47:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:47:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464644574] [2024-10-11 11:47:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:47:55,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:47:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:47:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:47:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:47:55,902 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:47:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:47:56,144 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2024-10-11 11:47:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:47:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-11 11:47:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:47:56,147 INFO L225 Difference]: With dead ends: 368 [2024-10-11 11:47:56,147 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 11:47:56,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:47:56,153 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 153 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:47:56,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 287 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:47:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 11:47:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 129. [2024-10-11 11:47:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:47:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-10-11 11:47:56,200 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 91 [2024-10-11 11:47:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:47:56,201 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-10-11 11:47:56,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:47:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-10-11 11:47:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:47:56,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:47:56,203 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:47:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:47:56,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:47:56,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:47:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 382528289, now seen corresponding path program 1 times [2024-10-11 11:47:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:47:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593637850] [2024-10-11 11:47:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:47:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:47:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:11,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593637850] [2024-10-11 11:48:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593637850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 11:48:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607177755] [2024-10-11 11:48:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:11,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:48:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:48:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:48:11,247 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:14,126 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2024-10-11 11:48:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:48:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:48:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:14,129 INFO L225 Difference]: With dead ends: 465 [2024-10-11 11:48:14,129 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 11:48:14,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:48:14,131 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 472 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:14,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 434 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 11:48:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 11:48:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 187. [2024-10-11 11:48:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 144 states have internal predecessors, (205), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 283 transitions. [2024-10-11 11:48:14,171 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 283 transitions. Word has length 92 [2024-10-11 11:48:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:14,172 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 283 transitions. [2024-10-11 11:48:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2024-10-11 11:48:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:48:14,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:14,176 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:14,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:48:14,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:14,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash 439786591, now seen corresponding path program 1 times [2024-10-11 11:48:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629797994] [2024-10-11 11:48:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629797994] [2024-10-11 11:48:17,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629797994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:17,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:17,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:48:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042211358] [2024-10-11 11:48:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:17,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:48:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:48:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:48:17,552 INFO L87 Difference]: Start difference. First operand 187 states and 283 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:18,296 INFO L93 Difference]: Finished difference Result 500 states and 751 transitions. [2024-10-11 11:48:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:48:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:48:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:18,300 INFO L225 Difference]: With dead ends: 500 [2024-10-11 11:48:18,301 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 11:48:18,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:48:18,304 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 348 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:18,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 286 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:48:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 11:48:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 228. [2024-10-11 11:48:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 185 states have internal predecessors, (266), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-11 11:48:18,347 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 92 [2024-10-11 11:48:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:18,348 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-11 11:48:18,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-11 11:48:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:48:18,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:18,350 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:18,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:48:18,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:18,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash -426818337, now seen corresponding path program 1 times [2024-10-11 11:48:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133988297] [2024-10-11 11:48:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133988297] [2024-10-11 11:48:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133988297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:21,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:48:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045207625] [2024-10-11 11:48:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:48:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:48:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:48:21,792 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:22,594 INFO L93 Difference]: Finished difference Result 572 states and 848 transitions. [2024-10-11 11:48:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:48:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:48:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:22,597 INFO L225 Difference]: With dead ends: 572 [2024-10-11 11:48:22,597 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 11:48:22,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:48:22,599 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 293 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:22,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 291 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:48:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 11:48:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 331. [2024-10-11 11:48:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 288 states have (on average 1.4409722222222223) internal successors, (415), 288 states have internal predecessors, (415), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2024-10-11 11:48:22,626 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 92 [2024-10-11 11:48:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2024-10-11 11:48:22,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2024-10-11 11:48:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:48:22,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:22,629 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:22,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:48:22,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2004124240, now seen corresponding path program 1 times [2024-10-11 11:48:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914696593] [2024-10-11 11:48:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914696593] [2024-10-11 11:48:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914696593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:48:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752319937] [2024-10-11 11:48:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:24,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:48:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:48:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:48:24,502 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:24,947 INFO L93 Difference]: Finished difference Result 597 states and 885 transitions. [2024-10-11 11:48:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:48:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:48:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:24,951 INFO L225 Difference]: With dead ends: 597 [2024-10-11 11:48:24,951 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 11:48:24,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:48:24,953 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 165 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:24,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 279 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:48:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 11:48:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2024-10-11 11:48:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.4241379310344828) internal successors, (413), 290 states have internal predecessors, (413), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 491 transitions. [2024-10-11 11:48:24,985 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 491 transitions. Word has length 92 [2024-10-11 11:48:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:24,986 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 491 transitions. [2024-10-11 11:48:24,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 491 transitions. [2024-10-11 11:48:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:48:24,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:24,990 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:24,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:48:24,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -204277725, now seen corresponding path program 1 times [2024-10-11 11:48:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015819316] [2024-10-11 11:48:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015819316] [2024-10-11 11:48:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015819316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:48:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370954785] [2024-10-11 11:48:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:25,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:48:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:48:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:48:25,275 INFO L87 Difference]: Start difference. First operand 333 states and 491 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:25,468 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2024-10-11 11:48:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:48:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-11 11:48:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:25,470 INFO L225 Difference]: With dead ends: 515 [2024-10-11 11:48:25,470 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 11:48:25,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-11 11:48:25,472 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 77 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:25,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 216 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:48:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 11:48:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-10-11 11:48:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 258 states have (on average 1.3914728682170543) internal successors, (359), 258 states have internal predecessors, (359), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-10-11 11:48:25,506 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 92 [2024-10-11 11:48:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-10-11 11:48:25,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-10-11 11:48:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:48:25,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:25,509 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:25,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:48:25,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:25,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1857641747, now seen corresponding path program 1 times [2024-10-11 11:48:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563546509] [2024-10-11 11:48:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:30,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563546509] [2024-10-11 11:48:30,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563546509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:30,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:48:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429375848] [2024-10-11 11:48:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:30,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:48:30,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:48:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:48:30,553 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:31,798 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2024-10-11 11:48:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:48:31,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-11 11:48:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:31,802 INFO L225 Difference]: With dead ends: 607 [2024-10-11 11:48:31,802 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 11:48:31,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:48:31,805 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 368 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:31,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 435 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:48:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 11:48:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 317. [2024-10-11 11:48:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 272 states have internal predecessors, (375), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 453 transitions. [2024-10-11 11:48:31,837 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 453 transitions. Word has length 93 [2024-10-11 11:48:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:31,838 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 453 transitions. [2024-10-11 11:48:31,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 453 transitions. [2024-10-11 11:48:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:48:31,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:31,839 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:31,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:48:31,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -225569315, now seen corresponding path program 1 times [2024-10-11 11:48:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847325160] [2024-10-11 11:48:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847325160] [2024-10-11 11:48:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847325160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:38,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:48:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560778560] [2024-10-11 11:48:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:38,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:48:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:48:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:48:38,115 INFO L87 Difference]: Start difference. First operand 317 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:39,928 INFO L93 Difference]: Finished difference Result 802 states and 1147 transitions. [2024-10-11 11:48:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 11:48:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-11 11:48:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:39,932 INFO L225 Difference]: With dead ends: 802 [2024-10-11 11:48:39,933 INFO L226 Difference]: Without dead ends: 606 [2024-10-11 11:48:39,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2024-10-11 11:48:39,934 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 285 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:39,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 410 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:48:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-11 11:48:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 414. [2024-10-11 11:48:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.3983739837398375) internal successors, (516), 369 states have internal predecessors, (516), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:48:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 594 transitions. [2024-10-11 11:48:39,970 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 594 transitions. Word has length 93 [2024-10-11 11:48:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:39,972 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 594 transitions. [2024-10-11 11:48:39,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 594 transitions. [2024-10-11 11:48:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:48:39,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:39,974 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:48:39,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:39,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1199261846, now seen corresponding path program 1 times [2024-10-11 11:48:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824326686] [2024-10-11 11:48:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824326686] [2024-10-11 11:48:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824326686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:47,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 11:48:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305791192] [2024-10-11 11:48:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:47,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:48:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:48:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:48:47,444 INFO L87 Difference]: Start difference. First operand 414 states and 594 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:50,621 INFO L93 Difference]: Finished difference Result 1172 states and 1706 transitions. [2024-10-11 11:48:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 11:48:50,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-11 11:48:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:50,628 INFO L225 Difference]: With dead ends: 1172 [2024-10-11 11:48:50,628 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 11:48:50,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2024-10-11 11:48:50,630 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 601 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:50,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 493 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 11:48:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 11:48:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 648. [2024-10-11 11:48:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 573 states have (on average 1.4101221640488657) internal successors, (808), 573 states have internal predecessors, (808), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 11:48:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 938 transitions. [2024-10-11 11:48:50,680 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 938 transitions. Word has length 94 [2024-10-11 11:48:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 938 transitions. [2024-10-11 11:48:50,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:48:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 938 transitions. [2024-10-11 11:48:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:48:50,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:50,684 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:48:50,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 11:48:50,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:50,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 51372386, now seen corresponding path program 1 times [2024-10-11 11:48:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552365587] [2024-10-11 11:48:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:48:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:48:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552365587] [2024-10-11 11:48:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552365587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:48:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305613428] [2024-10-11 11:48:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:57,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:48:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:57,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:48:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:48:57,976 INFO L87 Difference]: Start difference. First operand 648 states and 938 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:49:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:02,019 INFO L93 Difference]: Finished difference Result 1508 states and 2180 transitions. [2024-10-11 11:49:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 11:49:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-11 11:49:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:02,027 INFO L225 Difference]: With dead ends: 1508 [2024-10-11 11:49:02,027 INFO L226 Difference]: Without dead ends: 1082 [2024-10-11 11:49:02,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-10-11 11:49:02,030 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 388 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:02,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 360 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 11:49:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-10-11 11:49:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 690. [2024-10-11 11:49:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.408130081300813) internal successors, (866), 615 states have internal predecessors, (866), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 11:49:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 996 transitions. [2024-10-11 11:49:02,093 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 996 transitions. Word has length 94 [2024-10-11 11:49:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 996 transitions. [2024-10-11 11:49:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 11:49:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 996 transitions. [2024-10-11 11:49:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:49:02,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:02,095 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:49:02,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 11:49:02,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:02,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -815232542, now seen corresponding path program 1 times [2024-10-11 11:49:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496577372] [2024-10-11 11:49:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:49:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:49:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:49:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:49:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:49:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:49:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:49:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:49:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:49:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:49:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:49:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:49:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:49:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 11:49:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:49:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496577372] [2024-10-11 11:49:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496577372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:49:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828607373] [2024-10-11 11:49:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:08,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:49:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:08,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:49:08,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:49:08,450 INFO L87 Difference]: Start difference. First operand 690 states and 996 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)