./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_fillercode_fillercodestructure_filler-pe-co_file-28.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_fillercode_fillercodestructure_filler-pe-co_file-28.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 4643bf105c5d297e349c784c5b6d1d7e76636f96e2a0244468d2c82d05f2f0b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:15:59,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:15:59,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:15:59,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:15:59,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:15:59,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:15:59,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:15:59,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:15:59,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:15:59,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:15:59,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:15:59,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:15:59,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:15:59,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:15:59,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:15:59,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:15:59,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:15:59,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:15:59,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:15:59,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:15:59,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:15:59,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:15:59,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:15:59,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:15:59,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:15:59,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:15:59,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:15:59,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:15:59,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:15:59,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:15:59,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:15:59,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:15:59,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:15:59,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:15:59,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:15:59,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:15:59,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:15:59,102 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 -> 4643bf105c5d297e349c784c5b6d1d7e76636f96e2a0244468d2c82d05f2f0b9 [2024-10-11 09:15:59,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:15:59,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:15:59,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:15:59,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:15:59,322 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:15:59,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2024-10-11 09:16:00,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:16:00,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:16:00,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2024-10-11 09:16:00,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/327a8ac72/e974b2d152e04eba90ceee08b9b0ff35/FLAGd34536474 [2024-10-11 09:16:00,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/327a8ac72/e974b2d152e04eba90ceee08b9b0ff35 [2024-10-11 09:16:00,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:16:00,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:16:00,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:00,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:16:00,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:16:00,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:00" (1/1) ... [2024-10-11 09:16:00,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4ccd23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:00, skipping insertion in model container [2024-10-11 09:16:00,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:00" (1/1) ... [2024-10-11 09:16:00,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:16:00,876 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_fillercode_fillercodestructure_filler-pe-co_file-28.i[919,932] [2024-10-11 09:16:01,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:01,015 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:16:01,024 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_fillercode_fillercodestructure_filler-pe-co_file-28.i[919,932] [2024-10-11 09:16:01,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:01,058 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:16:01,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01 WrapperNode [2024-10-11 09:16:01,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:01,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:01,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:16:01,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:16:01,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,114 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-10-11 09:16:01,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:01,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:16:01,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:16:01,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:16:01,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,156 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 09:16:01,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:16:01,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:16:01,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:16:01,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:16:01,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (1/1) ... [2024-10-11 09:16:01,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:16:01,217 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 09:16:01,219 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 09:16:01,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:16:01,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:16:01,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:16:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:16:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:16:01,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:16:01,338 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:16:01,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:16:01,670 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 09:16:01,670 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:16:01,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:16:01,696 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:16:01,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:01 BoogieIcfgContainer [2024-10-11 09:16:01,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:16:01,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:16:01,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:16:01,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:16:01,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:16:00" (1/3) ... [2024-10-11 09:16:01,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5a85de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:01, skipping insertion in model container [2024-10-11 09:16:01,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:01" (2/3) ... [2024-10-11 09:16:01,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5a85de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:01, skipping insertion in model container [2024-10-11 09:16:01,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:01" (3/3) ... [2024-10-11 09:16:01,704 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2024-10-11 09:16:01,716 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:16:01,716 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:16:01,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:16:01,766 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;@107c9b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:16:01,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:16:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 09:16:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 09:16:01,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:01,784 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:01,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:01,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1612357611, now seen corresponding path program 1 times [2024-10-11 09:16:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567238147] [2024-10-11 09:16:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:16:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:16:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:16:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:16:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:16:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:16:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:16:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:16:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:16:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:16:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:16:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:16:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:16:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:16:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:16:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:16:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:16:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:16:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:16:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:16:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:16:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:16:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 09:16:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:02,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567238147] [2024-10-11 09:16:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567238147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:16:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138167749] [2024-10-11 09:16:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:16:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:02,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:16:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:16:02,271 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 09:16:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:02,366 INFO L93 Difference]: Finished difference Result 193 states and 339 transitions. [2024-10-11 09:16:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:16:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2024-10-11 09:16:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:02,378 INFO L225 Difference]: With dead ends: 193 [2024-10-11 09:16:02,378 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 09:16:02,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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 09:16:02,385 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:02,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 09:16:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 09:16:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 09:16:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2024-10-11 09:16:02,434 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 189 [2024-10-11 09:16:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:02,436 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2024-10-11 09:16:02,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 09:16:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2024-10-11 09:16:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 09:16:02,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:02,440 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:16:02,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 366929807, now seen corresponding path program 1 times [2024-10-11 09:16:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091611217] [2024-10-11 09:16:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:16:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:16:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:16:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:16:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:16:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:16:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:16:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:16:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:16:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:16:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:16:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:16:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:16:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:16:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:16:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:16:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:16:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:16:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:16:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:16:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:16:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:16:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 09:16:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:02,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091611217] [2024-10-11 09:16:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091611217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:02,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:02,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:16:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382228061] [2024-10-11 09:16:02,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:16:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:16:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:16:02,839 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 09:16:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:02,876 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2024-10-11 09:16:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:16:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-11 09:16:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:02,879 INFO L225 Difference]: With dead ends: 192 [2024-10-11 09:16:02,879 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 09:16:02,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:16:02,883 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:02,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 09:16:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 09:16:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 09:16:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 151 transitions. [2024-10-11 09:16:02,903 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 151 transitions. Word has length 189 [2024-10-11 09:16:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 151 transitions. [2024-10-11 09:16:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 09:16:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 151 transitions. [2024-10-11 09:16:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 09:16:02,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:02,910 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:02,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:16:02,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:02,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1046988177, now seen corresponding path program 1 times [2024-10-11 09:16:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527261002] [2024-10-11 09:16:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:16:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:16:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:16:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:16:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:16:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:16:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:16:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:16:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:16:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:16:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:16:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:16:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:16:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:16:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:16:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:16:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:16:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:16:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:16:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:16:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:16:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:16:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:16:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:16:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:16:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:16:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 09:16:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527261002] [2024-10-11 09:16:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527261002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 09:16:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878769719] [2024-10-11 09:16:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:54,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:16:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:16:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:16:54,682 INFO L87 Difference]: Start difference. First operand 97 states and 151 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 09:16:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:56,964 INFO L93 Difference]: Finished difference Result 413 states and 641 transitions. [2024-10-11 09:16:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:16:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 189 [2024-10-11 09:16:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:56,968 INFO L225 Difference]: With dead ends: 413 [2024-10-11 09:16:56,968 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 09:16:56,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:16:56,969 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 416 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:56,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 667 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 09:16:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 09:16:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2024-10-11 09:16:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 160 states have (on average 1.4375) internal successors, (230), 160 states have internal predecessors, (230), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 09:16:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2024-10-11 09:16:56,991 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 189 [2024-10-11 09:16:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:56,992 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2024-10-11 09:16:56,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 09:16:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2024-10-11 09:16:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 09:16:56,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:56,994 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:16:56,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:56,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1469690003, now seen corresponding path program 1 times [2024-10-11 09:16:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853821458] [2024-10-11 09:16:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat