./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.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 a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:13:30,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:13:30,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 11:13:30,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:13:30,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:13:30,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:13:30,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:13:30,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:13:30,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:13:30,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:13:30,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:13:30,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:13:30,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:13:30,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:13:30,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:13:30,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:13:30,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:13:30,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:13:30,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:13:30,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:13:30,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:13:30,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:13:30,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:13:30,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:13:30,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:13:30,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:13:30,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:13:30,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:13:30,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:13:30,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:13:30,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:13:30,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:13:30,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:13:30,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:13:30,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:13:30,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:13:30,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:13:30,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:13:30,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:13:30,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:13:30,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:13:30,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:13:30,673 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 -> a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b [2024-10-11 11:13:30,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:13:30,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:13:30,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:13:30,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:13:30,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:13:30,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i [2024-10-11 11:13:32,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:13:32,694 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:13:32,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i [2024-10-11 11:13:32,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d7e62b21/e8b1d6d3745b4c65b2b6e9e8911c41de/FLAG83f588e52 [2024-10-11 11:13:32,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d7e62b21/e8b1d6d3745b4c65b2b6e9e8911c41de [2024-10-11 11:13:32,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:13:32,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:13:32,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:13:32,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:13:32,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:13:32,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:13:32" (1/1) ... [2024-10-11 11:13:32,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604b67a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:32, skipping insertion in model container [2024-10-11 11:13:32,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:13:32" (1/1) ... [2024-10-11 11:13:32,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:13:32,965 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-10-11 11:13:33,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:13:33,090 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:13:33,104 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-10-11 11:13:33,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:13:33,173 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:13:33,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33 WrapperNode [2024-10-11 11:13:33,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:13:33,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:13:33,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:13:33,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:13:33,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,246 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 277 [2024-10-11 11:13:33,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:13:33,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:13:33,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:13:33,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:13:33,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,299 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:13:33,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:13:33,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:13:33,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:13:33,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:13:33,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (1/1) ... [2024-10-11 11:13:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:13:33,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:13:33,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:13:33,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:13:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:13:33,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:13:33,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:13:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:13:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:13:33,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:13:33,549 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:13:33,551 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:13:34,055 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-11 11:13:34,056 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:13:34,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:13:34,094 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:13:34,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:13:34 BoogieIcfgContainer [2024-10-11 11:13:34,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:13:34,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:13:34,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:13:34,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:13:34,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:13:32" (1/3) ... [2024-10-11 11:13:34,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ac3243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:13:34, skipping insertion in model container [2024-10-11 11:13:34,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:13:33" (2/3) ... [2024-10-11 11:13:34,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ac3243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:13:34, skipping insertion in model container [2024-10-11 11:13:34,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:13:34" (3/3) ... [2024-10-11 11:13:34,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-14.i [2024-10-11 11:13:34,126 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:13:34,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:13:34,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:13:34,205 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;@58ce42d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:13:34,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:13:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:13:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 11:13:34,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:34,235 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:34,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:34,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash -200439670, now seen corresponding path program 1 times [2024-10-11 11:13:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:13:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729082738] [2024-10-11 11:13:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:13:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:13:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:13:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:13:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:13:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:13:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:13:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:13:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:13:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:13:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:13:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:13:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:13:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:13:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:13:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:13:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:13:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:13:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:13:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:13:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:13:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:13:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:13:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:13:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:13:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 11:13:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 11:13:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 11:13:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 11:13:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:13:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:13:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 11:13:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:13:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:13:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729082738] [2024-10-11 11:13:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729082738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:13:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:13:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:13:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059939644] [2024-10-11 11:13:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:13:34,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:13:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:13:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:13:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:13:34,954 INFO L87 Difference]: Start difference. First operand has 109 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:13:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:13:35,071 INFO L93 Difference]: Finished difference Result 214 states and 377 transitions. [2024-10-11 11:13:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:13:35,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-11 11:13:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:13:35,093 INFO L225 Difference]: With dead ends: 214 [2024-10-11 11:13:35,094 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:13:35,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:13:35,105 INFO L432 NwaCegarLoop]: 164 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, 164 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 11:13:35,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:13:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:13:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 11:13:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:13:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-11 11:13:35,164 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 198 [2024-10-11 11:13:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:13:35,165 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-11 11:13:35,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 11:13:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-11 11:13:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 11:13:35,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:35,173 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:13:35,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1829634680, now seen corresponding path program 1 times [2024-10-11 11:13:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:13:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940942925] [2024-10-11 11:13:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:13:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:13:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:13:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:13:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:13:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:13:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:13:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:13:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:13:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:13:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:13:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:13:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:13:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:13:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:13:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:13:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:13:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:13:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:13:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:13:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:13:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:13:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:13:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:13:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:13:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 11:13:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 11:13:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 11:13:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 11:13:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:13:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:13:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 11:13:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:13:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:13:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940942925] [2024-10-11 11:13:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940942925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:13:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:13:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:13:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443762480] [2024-10-11 11:13:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:13:35,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:13:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:13:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:13:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:13:35,798 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:13:35,885 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2024-10-11 11:13:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:13:35,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-11 11:13:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:13:35,889 INFO L225 Difference]: With dead ends: 212 [2024-10-11 11:13:35,889 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 11:13:35,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:13:35,895 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:13:35,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 628 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:13:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 11:13:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 11:13:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:13:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-10-11 11:13:35,921 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 198 [2024-10-11 11:13:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:13:35,923 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-10-11 11:13:35,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-10-11 11:13:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:13:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:35,928 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:13:35,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1884229100, now seen corresponding path program 1 times [2024-10-11 11:13:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:13:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88018714] [2024-10-11 11:13:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:13:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:13:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:13:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:13:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:13:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:13:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:13:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:13:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:13:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:13:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:13:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:13:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:13:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:13:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:13:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:13:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:13:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:13:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:13:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:13:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:13:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:13:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:13:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:13:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:13:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 11:13:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 11:13:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 11:13:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 11:13:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:13:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:13:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 11:13:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:13:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:13:42,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88018714] [2024-10-11 11:13:42,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88018714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:13:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:13:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 11:13:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515965862] [2024-10-11 11:13:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:13:42,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:13:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:13:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:13:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:13:42,381 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:13:49,206 INFO L93 Difference]: Finished difference Result 457 states and 705 transitions. [2024-10-11 11:13:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:13:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-11 11:13:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:13:49,214 INFO L225 Difference]: With dead ends: 457 [2024-10-11 11:13:49,214 INFO L226 Difference]: Without dead ends: 351 [2024-10-11 11:13:49,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-10-11 11:13:49,216 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 769 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:13:49,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 896 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 11:13:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-11 11:13:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 248. [2024-10-11 11:13:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.4388888888888889) internal successors, (259), 181 states have internal predecessors, (259), 64 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:13:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 387 transitions. [2024-10-11 11:13:49,264 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 387 transitions. Word has length 199 [2024-10-11 11:13:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:13:49,265 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 387 transitions. [2024-10-11 11:13:49,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 387 transitions. [2024-10-11 11:13:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:13:49,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:49,271 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:13:49,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:49,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1601391570, now seen corresponding path program 1 times [2024-10-11 11:13:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:13:49,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958766348] [2024-10-11 11:13:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:13:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:13:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:13:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:13:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:13:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:13:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:13:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:13:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:13:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:13:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:13:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:13:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:13:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:13:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:13:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:13:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:13:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:13:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:13:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:13:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:13:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 11:13:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 11:13:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 11:13:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 11:13:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 11:13:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 11:13:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 11:13:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 11:13:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:13:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:13:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 11:13:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:13:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 11:13:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:13:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958766348] [2024-10-11 11:13:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958766348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:13:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:13:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:13:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84533065] [2024-10-11 11:13:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:13:50,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:13:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:13:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:13:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:13:50,159 INFO L87 Difference]: Start difference. First operand 248 states and 387 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:13:50,399 INFO L93 Difference]: Finished difference Result 497 states and 772 transitions. [2024-10-11 11:13:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:13:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-11 11:13:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:13:50,403 INFO L225 Difference]: With dead ends: 497 [2024-10-11 11:13:50,405 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 11:13:50,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:13:50,410 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 71 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:13:50,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 487 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:13:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 11:13:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2024-10-11 11:13:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.388157894736842) internal successors, (211), 153 states have internal predecessors, (211), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:13:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 339 transitions. [2024-10-11 11:13:50,455 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 339 transitions. Word has length 199 [2024-10-11 11:13:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:13:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 339 transitions. [2024-10-11 11:13:50,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 11:13:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 339 transitions. [2024-10-11 11:13:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 11:13:50,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:13:50,459 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:13:50,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:13:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:13:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -619726695, now seen corresponding path program 1 times [2024-10-11 11:13:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:13:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235413968] [2024-10-11 11:13:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:13:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:13:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat