./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_fillercodesize_ps-cn-25_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a501f4e7d5c1c73a982e19160959ef23494250903653e32c772aa19d46349357 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:41:15,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:41:15,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:41:15,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:41:15,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:41:15,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:41:15,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:41:15,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:41:15,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:41:15,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:41:15,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:41:15,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:41:15,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:41:15,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:41:15,953 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:41:15,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:41:15,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:41:15,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:41:15,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:41:15,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:41:15,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:41:15,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:41:15,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:41:15,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:41:15,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:41:15,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:41:15,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:41:15,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:41:15,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:41:15,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:41:15,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:41:15,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:41:15,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:41:15,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:41:15,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:41:15,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:41:15,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:41:15,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:41:15,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:41:15,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:41:15,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:41:15,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:41:15,967 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/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/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 -> a501f4e7d5c1c73a982e19160959ef23494250903653e32c772aa19d46349357 [2024-10-14 08:41:16,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:41:16,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:41:16,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:41:16,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:41:16,250 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:41:16,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-98.i [2024-10-14 08:41:17,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:41:17,868 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:41:17,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-98.i [2024-10-14 08:41:17,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aab6f668/1c52544881624b8e85908c8604021ac7/FLAGe638fb01e [2024-10-14 08:41:18,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aab6f668/1c52544881624b8e85908c8604021ac7 [2024-10-14 08:41:18,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:41:18,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:41:18,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:41:18,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:41:18,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:41:18,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3fe29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18, skipping insertion in model container [2024-10-14 08:41:18,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:41:18,427 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_fillercodesize_ps-cn-25_file-98.i[915,928] [2024-10-14 08:41:18,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:41:18,569 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:41:18,584 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_fillercodesize_ps-cn-25_file-98.i[915,928] [2024-10-14 08:41:18,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:41:18,661 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:41:18,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18 WrapperNode [2024-10-14 08:41:18,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:41:18,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:41:18,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:41:18,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:41:18,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,726 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-10-14 08:41:18,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:41:18,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:41:18,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:41:18,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:41:18,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,768 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-14 08:41:18,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:41:18,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:41:18,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:41:18,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:41:18,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (1/1) ... [2024-10-14 08:41:18,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:41:18,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:41:18,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:41:18,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:41:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:41:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:41:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:41:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:41:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:41:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:41:19,000 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:41:19,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:41:19,492 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 08:41:19,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:41:19,531 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:41:19,531 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:41:19,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:41:19 BoogieIcfgContainer [2024-10-14 08:41:19,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:41:19,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:41:19,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:41:19,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:41:19,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:41:18" (1/3) ... [2024-10-14 08:41:19,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f489d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:41:19, skipping insertion in model container [2024-10-14 08:41:19,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:41:18" (2/3) ... [2024-10-14 08:41:19,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f489d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:41:19, skipping insertion in model container [2024-10-14 08:41:19,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:41:19" (3/3) ... [2024-10-14 08:41:19,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-98.i [2024-10-14 08:41:19,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:41:19,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:41:19,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:41:19,632 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;@5f26e213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:41:19,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:41:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 08:41:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-14 08:41:19,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:41:19,651 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:41:19,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:41:19,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:41:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -720067027, now seen corresponding path program 1 times [2024-10-14 08:41:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:41:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51257944] [2024-10-14 08:41:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:41:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:41:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:41:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:41:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 08:41:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:41:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 08:41:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 08:41:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 08:41:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:41:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:41:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:41:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:41:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:41:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:41:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:41:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:41:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:41:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:41:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:41:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:41:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:41:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:41:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:41:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:41:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:41:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:41:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:41:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:41:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:41:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:41:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:41:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:41:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:41:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:41:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:41:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:41:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 08:41:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:41:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 08:41:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:41:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 08:41:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-14 08:41:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:41:20,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51257944] [2024-10-14 08:41:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51257944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:41:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:41:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:41:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245026902] [2024-10-14 08:41:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:41:20,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:41:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:41:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:41:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:41:20,368 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-14 08:41:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:41:20,436 INFO L93 Difference]: Finished difference Result 201 states and 366 transitions. [2024-10-14 08:41:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:41:20,439 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 243 [2024-10-14 08:41:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:41:20,449 INFO L225 Difference]: With dead ends: 201 [2024-10-14 08:41:20,449 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 08:41:20,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-14 08:41:20,462 INFO L432 NwaCegarLoop]: 156 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, 156 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-14 08:41:20,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:41:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 08:41:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-14 08:41:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 08:41:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 159 transitions. [2024-10-14 08:41:20,532 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 159 transitions. Word has length 243 [2024-10-14 08:41:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:41:20,533 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 159 transitions. [2024-10-14 08:41:20,533 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-14 08:41:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 159 transitions. [2024-10-14 08:41:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-14 08:41:20,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:41:20,541 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:41:20,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:41:20,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:41:20,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:41:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -367380111, now seen corresponding path program 1 times [2024-10-14 08:41:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:41:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588028932] [2024-10-14 08:41:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:41:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:41:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:41:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:41:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 08:41:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:41:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 08:41:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 08:41:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 08:41:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:41:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:41:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:41:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:41:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:41:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:41:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:41:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:41:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:41:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:41:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:41:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:41:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:41:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:41:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:41:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:41:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:41:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:41:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:41:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:41:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:41:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:41:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:41:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:41:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:41:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:41:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:41:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:41:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 08:41:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:41:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 08:41:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:41:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 08:41:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-14 08:41:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:41:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588028932] [2024-10-14 08:41:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588028932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:41:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:41:21,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:41:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710558297] [2024-10-14 08:41:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:41:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:41:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:41:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:41:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:41:21,609 INFO L87 Difference]: Start difference. First operand 100 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-14 08:41:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:41:21,667 INFO L93 Difference]: Finished difference Result 200 states and 319 transitions. [2024-10-14 08:41:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:41:21,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 243 [2024-10-14 08:41:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:41:21,674 INFO L225 Difference]: With dead ends: 200 [2024-10-14 08:41:21,675 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 08:41:21,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 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-14 08:41:21,678 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:41:21,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:41:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 08:41:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 08:41:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 08:41:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2024-10-14 08:41:21,697 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 243 [2024-10-14 08:41:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:41:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2024-10-14 08:41:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-14 08:41:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2024-10-14 08:41:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-14 08:41:21,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:41:21,712 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:41:21,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:41:21,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:41:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:41:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -188566862, now seen corresponding path program 1 times [2024-10-14 08:41:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:41:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383252480] [2024-10-14 08:41:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:41:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:41:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:41:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:41:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 08:41:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:41:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 08:41:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 08:41:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 08:41:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:41:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:41:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:41:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:41:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:41:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:41:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:41:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:41:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:41:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:41:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:41:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:41:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:41:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:41:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:41:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:41:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:41:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:41:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:41:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:41:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 08:41:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:41:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 08:41:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:41:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 08:41:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:41:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:41:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:41:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 08:41:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:41:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 08:41:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:41:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 08:41:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:41:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-14 08:41:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:41:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383252480] [2024-10-14 08:41:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383252480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:41:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:41:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 08:41:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329125045] [2024-10-14 08:41:23,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:41:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 08:41:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:41:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 08:41:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:41:23,349 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-14 08:41:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:41:24,237 INFO L93 Difference]: Finished difference Result 425 states and 671 transitions. [2024-10-14 08:41:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 08:41:24,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 244 [2024-10-14 08:41:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:41:24,242 INFO L225 Difference]: With dead ends: 425 [2024-10-14 08:41:24,243 INFO L226 Difference]: Without dead ends: 325 [2024-10-14 08:41:24,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:41:24,245 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 453 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 08:41:24,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 493 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 08:41:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-14 08:41:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 240. [2024-10-14 08:41:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 137 states have internal predecessors, (178), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-14 08:41:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 378 transitions. [2024-10-14 08:41:24,346 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 378 transitions. Word has length 244 [2024-10-14 08:41:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:41:24,347 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 378 transitions. [2024-10-14 08:41:24,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-14 08:41:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 378 transitions. [2024-10-14 08:41:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-14 08:41:24,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:41:24,352 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 08:41:24,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:41:24,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:41:24,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:41:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash -131308560, now seen corresponding path program 1 times [2024-10-14 08:41:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:41:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861965107] [2024-10-14 08:41:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:41:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:41:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat