./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_codestructure_dependencies_file-10.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_codestructure_dependencies_file-10.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 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:05:09,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:05:09,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:05:09,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:05:09,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:05:09,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:05:09,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:05:09,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:05:09,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:05:09,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:05:09,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:05:09,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:05:09,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:05:09,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:05:09,197 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:05:09,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:05:09,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:05:09,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:05:09,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:05:09,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:05:09,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:05:09,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:05:09,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:05:09,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:05:09,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:05:09,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:05:09,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:05:09,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:05:09,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:05:09,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:05:09,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:05:09,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:05:09,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:09,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:05:09,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:05:09,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:05:09,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:05:09,209 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 -> 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a [2024-10-11 07:05:09,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:05:09,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:05:09,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:05:09,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:05:09,444 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:05:09,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-10-11 07:05:10,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:05:10,912 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:05:10,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-10-11 07:05:10,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07fc4cc06/6ad3ac4c68874f65a48b23bb139532e5/FLAGd47117188 [2024-10-11 07:05:10,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/07fc4cc06/6ad3ac4c68874f65a48b23bb139532e5 [2024-10-11 07:05:10,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:05:10,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:05:10,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:10,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:05:10,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:05:10,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:10" (1/1) ... [2024-10-11 07:05:10,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4203d9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:10, skipping insertion in model container [2024-10-11 07:05:10,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:10" (1/1) ... [2024-10-11 07:05:10,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:05:11,139 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_codestructure_dependencies_file-10.i[919,932] [2024-10-11 07:05:11,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:11,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:05:11,227 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_codestructure_dependencies_file-10.i[919,932] [2024-10-11 07:05:11,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:11,276 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:05:11,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11 WrapperNode [2024-10-11 07:05:11,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:11,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:11,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:05:11,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:05:11,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,333 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-10-11 07:05:11,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:11,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:05:11,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:05:11,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:05:11,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,376 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 07:05:11,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:05:11,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:05:11,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:05:11,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:05:11,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (1/1) ... [2024-10-11 07:05:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:05:11,504 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 07:05:11,506 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 07:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:05:11,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:05:11,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:05:11,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:05:11,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:05:11,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:05:11,613 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:05:11,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:05:11,867 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:05:11,867 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:05:11,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:05:11,889 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:05:11,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:11 BoogieIcfgContainer [2024-10-11 07:05:11,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:05:11,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:05:11,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:05:11,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:05:11,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:05:10" (1/3) ... [2024-10-11 07:05:11,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70980cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:11, skipping insertion in model container [2024-10-11 07:05:11,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:11" (2/3) ... [2024-10-11 07:05:11,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70980cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:11, skipping insertion in model container [2024-10-11 07:05:11,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:11" (3/3) ... [2024-10-11 07:05:11,896 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-10.i [2024-10-11 07:05:11,909 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:05:11,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:05:11,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:05:11,972 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;@da3c5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:05:11,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:05:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:05:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:05:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:11,987 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:11,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 905988803, now seen corresponding path program 1 times [2024-10-11 07:05:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417362224] [2024-10-11 07:05:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:05:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:12,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417362224] [2024-10-11 07:05:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417362224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:05:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355055931] [2024-10-11 07:05:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:05:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:05:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:05:12,410 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:05:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:12,437 INFO L93 Difference]: Finished difference Result 127 states and 218 transitions. [2024-10-11 07:05:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:05:12,443 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-10-11 07:05:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:12,451 INFO L225 Difference]: With dead ends: 127 [2024-10-11 07:05:12,451 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 07:05:12,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 07:05:12,459 INFO L432 NwaCegarLoop]: 93 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, 93 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 07:05:12,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:05:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 07:05:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 07:05:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:05:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-11 07:05:12,507 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 115 [2024-10-11 07:05:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-11 07:05:12,509 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:05:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-11 07:05:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:05:12,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:12,513 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:12,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:05:12,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:12,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash -908189309, now seen corresponding path program 1 times [2024-10-11 07:05:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298118849] [2024-10-11 07:05:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:05:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298118849] [2024-10-11 07:05:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298118849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:05:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689545827] [2024-10-11 07:05:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:13,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:05:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:05:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:05:13,024 INFO L87 Difference]: Start difference. First operand 63 states and 96 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:05:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:13,167 INFO L93 Difference]: Finished difference Result 188 states and 287 transitions. [2024-10-11 07:05:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:05:13,168 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-11 07:05:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:13,171 INFO L225 Difference]: With dead ends: 188 [2024-10-11 07:05:13,172 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 07:05:13,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 07:05:13,175 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 64 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:13,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 268 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:05:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 07:05:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2024-10-11 07:05:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:05:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-11 07:05:13,209 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 115 [2024-10-11 07:05:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:13,210 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-11 07:05:13,210 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:05:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-11 07:05:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 07:05:13,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:13,213 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:05:13,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -114336162, now seen corresponding path program 1 times [2024-10-11 07:05:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801489805] [2024-10-11 07:05:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:05:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801489805] [2024-10-11 07:05:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801489805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:05:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921195299] [2024-10-11 07:05:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:05:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:34,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:05:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:05:34,452 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:05:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:35,450 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2024-10-11 07:05:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:05:35,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-11 07:05:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:35,453 INFO L225 Difference]: With dead ends: 309 [2024-10-11 07:05:35,453 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 07:05:35,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:05:35,455 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 304 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:35,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 433 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:05:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 07:05:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 123. [2024-10-11 07:05:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:05:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-10-11 07:05:35,487 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 116 [2024-10-11 07:05:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:35,488 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-10-11 07:05:35,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:05:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-10-11 07:05:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 07:05:35,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:35,494 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:05:35,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:35,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1660671200, now seen corresponding path program 1 times [2024-10-11 07:05:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381178090] [2024-10-11 07:05:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat