./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-71.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_floatingpointinfluence_no-floats_file-71.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 bdd440191e16c00f97117fa323e1fed0472aeb0b0b06d3627910cdb64f5322fa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:58:44,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:58:44,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:58:44,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:58:44,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:58:44,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:58:44,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:58:44,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:58:44,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:58:44,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:58:44,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:58:44,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:58:44,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:58:44,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:58:44,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:58:44,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:58:44,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:58:44,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:58:44,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:58:44,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:58:44,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:58:44,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:58:44,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:58:44,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:58:44,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:58:44,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:58:44,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:58:44,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:58:44,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:58:44,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:58:44,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:58:44,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:58:44,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:44,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:58:44,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:58:44,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:58:44,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:58:44,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:58:44,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:58:44,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:58:44,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:58:44,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:58:44,686 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 -> bdd440191e16c00f97117fa323e1fed0472aeb0b0b06d3627910cdb64f5322fa [2024-10-11 10:58:44,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:58:44,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:58:44,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:58:44,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:58:44,979 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:58:44,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-71.i [2024-10-11 10:58:46,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:58:46,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:58:46,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-71.i [2024-10-11 10:58:46,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0e13d4fff/47599a356fbe41298f9d012b837b61d6/FLAG45e5b8b31 [2024-10-11 10:58:46,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0e13d4fff/47599a356fbe41298f9d012b837b61d6 [2024-10-11 10:58:46,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:58:46,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:58:46,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:46,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:58:46,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:58:46,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:46" (1/1) ... [2024-10-11 10:58:46,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350f8d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:46, skipping insertion in model container [2024-10-11 10:58:46,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:46" (1/1) ... [2024-10-11 10:58:46,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:58:46,992 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-71.i[916,929] [2024-10-11 10:58:47,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:47,058 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:58:47,068 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-71.i[916,929] [2024-10-11 10:58:47,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:47,114 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:58:47,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47 WrapperNode [2024-10-11 10:58:47,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:47,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:47,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:58:47,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:58:47,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,168 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 10:58:47,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:47,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:58:47,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:58:47,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:58:47,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,227 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 10:58:47,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:58:47,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:58:47,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:58:47,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:58:47,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (1/1) ... [2024-10-11 10:58:47,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:47,332 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 10:58:47,336 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 10:58:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:58:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:58:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:58:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:58:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:58:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:58:47,442 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:58:47,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:58:47,727 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:58:47,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:58:47,788 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:58:47,788 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:58:47,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:47 BoogieIcfgContainer [2024-10-11 10:58:47,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:58:47,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:58:47,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:58:47,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:58:47,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:58:46" (1/3) ... [2024-10-11 10:58:47,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:47, skipping insertion in model container [2024-10-11 10:58:47,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:47" (2/3) ... [2024-10-11 10:58:47,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:47, skipping insertion in model container [2024-10-11 10:58:47,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:47" (3/3) ... [2024-10-11 10:58:47,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-71.i [2024-10-11 10:58:47,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:58:47,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:58:47,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:58:47,895 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;@6ff48ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:58:47,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:58:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:58:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 10:58:47,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:47,912 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:47,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:47,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1398522392, now seen corresponding path program 1 times [2024-10-11 10:58:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:47,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846121945] [2024-10-11 10:58:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:58:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:58:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846121945] [2024-10-11 10:58:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846121945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:48,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:58:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690711652] [2024-10-11 10:58:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:58:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:58:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:58:48,417 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 10:58:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:48,476 INFO L93 Difference]: Finished difference Result 93 states and 167 transitions. [2024-10-11 10:58:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:58:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 113 [2024-10-11 10:58:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:48,493 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:58:48,493 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:58:48,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 10:58:48,503 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:48,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:58:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:58:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:58:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:58:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-11 10:58:48,549 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 113 [2024-10-11 10:58:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-11 10:58:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 10:58:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-11 10:58:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 10:58:48,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:48,558 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:48,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:58:48,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:48,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2060733338, now seen corresponding path program 1 times [2024-10-11 10:58:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:48,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53618959] [2024-10-11 10:58:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:59:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:59:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53618959] [2024-10-11 10:59:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53618959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:59:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866173934] [2024-10-11 10:59:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:02,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:59:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:59:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:59:02,433 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:03,116 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2024-10-11 10:59:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:59:03,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 113 [2024-10-11 10:59:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:03,120 INFO L225 Difference]: With dead ends: 56 [2024-10-11 10:59:03,120 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 10:59:03,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:59:03,122 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:03,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 199 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:59:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 10:59:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-10-11 10:59:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 10:59:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 10:59:03,132 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 113 [2024-10-11 10:59:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 10:59:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 10:59:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 10:59:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:03,136 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:59:03,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1010226216, now seen corresponding path program 1 times [2024-10-11 10:59:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699517926] [2024-10-11 10:59:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:59:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:59:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699517926] [2024-10-11 10:59:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699517926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:03,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:03,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:59:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386044710] [2024-10-11 10:59:03,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:03,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:59:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:59:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:59:03,386 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:03,501 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2024-10-11 10:59:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:59:03,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-11 10:59:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:03,505 INFO L225 Difference]: With dead ends: 137 [2024-10-11 10:59:03,505 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 10:59:03,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 10:59:03,507 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:03,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:59:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 10:59:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-10-11 10:59:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:59:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-11 10:59:03,520 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 114 [2024-10-11 10:59:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-11 10:59:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-11 10:59:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 10:59:03,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:03,524 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:59:03,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 952967914, now seen corresponding path program 1 times [2024-10-11 10:59:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369533833] [2024-10-11 10:59:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:59:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:59:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369533833] [2024-10-11 10:59:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369533833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:59:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849002035] [2024-10-11 10:59:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:59:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:59:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:59:27,556 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:29,310 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2024-10-11 10:59:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:59:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-11 10:59:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:29,314 INFO L225 Difference]: With dead ends: 96 [2024-10-11 10:59:29,314 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 10:59:29,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:59:29,315 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:29,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 217 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 10:59:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 10:59:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2024-10-11 10:59:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:59:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-11 10:59:29,342 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 114 [2024-10-11 10:59:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:29,343 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-11 10:59:29,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-11 10:59:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 10:59:29,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:29,346 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:29,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:59:29,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1863242987, now seen corresponding path program 1 times [2024-10-11 10:59:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:29,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673018990] [2024-10-11 10:59:29,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:59:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:59:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:59:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:59:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:59:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:59:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:59:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:59:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:59:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673018990] [2024-10-11 10:59:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673018990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:59:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624612509] [2024-10-11 10:59:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:37,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:59:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:37,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:59:37,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:59:37,584 INFO L87 Difference]: Start difference. First operand 83 states and 124 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:59:38,262 INFO L93 Difference]: Finished difference Result 106 states and 154 transitions. [2024-10-11 10:59:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:59:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-11 10:59:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:59:38,264 INFO L225 Difference]: With dead ends: 106 [2024-10-11 10:59:38,265 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 10:59:38,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:59:38,266 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:59:38,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:59:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 10:59:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-10-11 10:59:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 10:59:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-10-11 10:59:38,281 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 115 [2024-10-11 10:59:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:59:38,282 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-10-11 10:59:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 10:59:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-10-11 10:59:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 10:59:38,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:59:38,284 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:59:38,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:59:38,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:59:38,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:59:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1805984685, now seen corresponding path program 1 times [2024-10-11 10:59:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:59:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342963722] [2024-10-11 10:59:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:59:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:59:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:00:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:00:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:00:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:00:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:00:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:00:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:00:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:00:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:00:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:00:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:00:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:00:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:00:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342963722] [2024-10-11 11:00:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342963722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:00,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:00:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194470051] [2024-10-11 11:00:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:00:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:00:00,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:00:00,690 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:00:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:02,812 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2024-10-11 11:00:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:00:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-11 11:00:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:02,814 INFO L225 Difference]: With dead ends: 104 [2024-10-11 11:00:02,814 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 11:00:02,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:00:02,815 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:02,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 285 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 11:00:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 11:00:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-10-11 11:00:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:00:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-11 11:00:02,831 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 115 [2024-10-11 11:00:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:02,831 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-11 11:00:02,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 11:00:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-11 11:00:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 11:00:02,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:02,833 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:02,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:00:02,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:02,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -656716947, now seen corresponding path program 1 times [2024-10-11 11:00:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681425106] [2024-10-11 11:00:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat