./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_operatoramount_amount50_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_operatoramount_amount50_file-64.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 47cd392676bec39dae7770de53e22dff9d81be51a0efae6a4b87035607bdf0b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:38:21,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:38:22,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:38:22,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:38:22,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:38:22,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:38:22,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:38:22,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:38:22,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:38:22,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:38:22,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:38:22,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:38:22,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:38:22,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:38:22,053 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:38:22,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:38:22,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:38:22,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:38:22,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:38:22,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:38:22,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:38:22,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:38:22,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:38:22,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:38:22,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:38:22,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:38:22,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:38:22,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:38:22,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:38:22,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:38:22,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:38:22,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:38:22,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:38:22,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:38:22,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:38:22,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:38:22,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:38:22,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:38:22,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:38:22,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:38:22,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:38:22,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:38:22,061 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 -> 47cd392676bec39dae7770de53e22dff9d81be51a0efae6a4b87035607bdf0b5 [2024-10-13 05:38:22,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:38:22,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:38:22,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:38:22,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:38:22,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:38:22,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i [2024-10-13 05:38:23,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:38:24,030 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:38:24,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-64.i [2024-10-13 05:38:24,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2b876a6/5a2e4bc9b0e24d24b525041e688621a2/FLAG4bf3e9ac2 [2024-10-13 05:38:24,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2b876a6/5a2e4bc9b0e24d24b525041e688621a2 [2024-10-13 05:38:24,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:38:24,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:38:24,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:38:24,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:38:24,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:38:24,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4814059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24, skipping insertion in model container [2024-10-13 05:38:24,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:38:24,310 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_operatoramount_amount50_file-64.i[915,928] [2024-10-13 05:38:24,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:38:24,388 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:38:24,401 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_operatoramount_amount50_file-64.i[915,928] [2024-10-13 05:38:24,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:38:24,455 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:38:24,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24 WrapperNode [2024-10-13 05:38:24,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:38:24,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:38:24,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:38:24,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:38:24,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,510 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-13 05:38:24,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:38:24,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:38:24,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:38:24,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:38:24,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,547 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-13 05:38:24,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:38:24,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:38:24,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:38:24,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:38:24,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (1/1) ... [2024-10-13 05:38:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:38:24,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:38:24,602 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-13 05:38:24,605 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-13 05:38:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:38:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:38:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:38:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:38:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:38:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:38:24,731 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:38:24,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:38:25,041 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 05:38:25,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:38:25,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:38:25,083 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:38:25,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:38:25 BoogieIcfgContainer [2024-10-13 05:38:25,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:38:25,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:38:25,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:38:25,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:38:25,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:38:24" (1/3) ... [2024-10-13 05:38:25,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5780863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:38:25, skipping insertion in model container [2024-10-13 05:38:25,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:38:24" (2/3) ... [2024-10-13 05:38:25,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5780863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:38:25, skipping insertion in model container [2024-10-13 05:38:25,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:38:25" (3/3) ... [2024-10-13 05:38:25,096 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-64.i [2024-10-13 05:38:25,116 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:38:25,116 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:38:25,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:38:25,184 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;@2470e275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:38:25,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:38:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:38:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 05:38:25,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:25,200 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:25,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1441737009, now seen corresponding path program 1 times [2024-10-13 05:38:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608979994] [2024-10-13 05:38:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:38:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:38:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:38:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:38:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:38:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:38:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:38:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:38:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:38:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:38:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:38:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:38:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:38:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:38:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:38:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 05:38:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:38:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 05:38:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 05:38:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 05:38:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 05:38:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 05:38:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 05:38:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 05:38:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 05:38:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 05:38:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 05:38:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:38:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608979994] [2024-10-13 05:38:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608979994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:38:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:38:25,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:38:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495394428] [2024-10-13 05:38:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:38:25,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:38:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:38:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:38:25,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:38:25,778 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 05:38:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:38:25,822 INFO L93 Difference]: Finished difference Result 135 states and 242 transitions. [2024-10-13 05:38:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:38:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-13 05:38:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:38:25,833 INFO L225 Difference]: With dead ends: 135 [2024-10-13 05:38:25,834 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 05:38:25,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-13 05:38:25,840 INFO L432 NwaCegarLoop]: 101 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, 101 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-13 05:38:25,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:38:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 05:38:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 05:38:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:38:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-13 05:38:25,886 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 159 [2024-10-13 05:38:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:38:25,888 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-13 05:38:25,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 05:38:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-13 05:38:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 05:38:25,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:25,893 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:38:25,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1493048719, now seen corresponding path program 1 times [2024-10-13 05:38:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156851570] [2024-10-13 05:38:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:38:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:38:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:38:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:38:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:38:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:38:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:38:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:38:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:38:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:38:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:38:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:38:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:38:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:38:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:38:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 05:38:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:38:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 05:38:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 05:38:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 05:38:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 05:38:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 05:38:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 05:38:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 05:38:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 05:38:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 05:38:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 05:38:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:38:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156851570] [2024-10-13 05:38:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156851570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:38:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:38:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:38:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823977043] [2024-10-13 05:38:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:38:26,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:38:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:38:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:38:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:38:26,455 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:38:26,720 INFO L93 Difference]: Finished difference Result 250 states and 385 transitions. [2024-10-13 05:38:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:38:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-13 05:38:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:38:26,726 INFO L225 Difference]: With dead ends: 250 [2024-10-13 05:38:26,726 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 05:38:26,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:38:26,728 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 183 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:38:26,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 440 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:38:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 05:38:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2024-10-13 05:38:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:38:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-13 05:38:26,748 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 159 [2024-10-13 05:38:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:38:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-13 05:38:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-13 05:38:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 05:38:26,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:26,758 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:26,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:38:26,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:26,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1026911215, now seen corresponding path program 1 times [2024-10-13 05:38:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025917551] [2024-10-13 05:38:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:38:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:38:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:38:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:38:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:38:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:38:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:38:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:38:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:38:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:38:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:38:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:38:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:38:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:38:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:38:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 05:38:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:38:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 05:38:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 05:38:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 05:38:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 05:38:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 05:38:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 05:38:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 05:38:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 05:38:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 05:38:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 05:38:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:38:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025917551] [2024-10-13 05:38:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025917551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:38:27,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:38:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:38:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879852818] [2024-10-13 05:38:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:38:27,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:38:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:38:27,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:38:27,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:38:27,111 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:38:27,343 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2024-10-13 05:38:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:38:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-13 05:38:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:38:27,351 INFO L225 Difference]: With dead ends: 254 [2024-10-13 05:38:27,352 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 05:38:27,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:38:27,356 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 173 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:38:27,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 462 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:38:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 05:38:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 71. [2024-10-13 05:38:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:38:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-13 05:38:27,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 159 [2024-10-13 05:38:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:38:27,386 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-13 05:38:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-13 05:38:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 05:38:27,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:27,392 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:27,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:38:27,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1925373071, now seen corresponding path program 1 times [2024-10-13 05:38:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:27,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638351581] [2024-10-13 05:38:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:38:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:38:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:38:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:38:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:38:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:38:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:38:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:38:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:38:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:38:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:38:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:38:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:38:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:38:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:38:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 05:38:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:38:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 05:38:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 05:38:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 05:38:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 05:38:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 05:38:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 05:38:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 05:38:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 05:38:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 05:38:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 05:38:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:38:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638351581] [2024-10-13 05:38:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638351581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:38:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:38:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:38:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422650439] [2024-10-13 05:38:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:38:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:38:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:38:30,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:38:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:38:30,824 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:38:31,056 INFO L93 Difference]: Finished difference Result 198 states and 305 transitions. [2024-10-13 05:38:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:38:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-13 05:38:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:38:31,059 INFO L225 Difference]: With dead ends: 198 [2024-10-13 05:38:31,059 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 05:38:31,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:38:31,062 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 106 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:38:31,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 542 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:38:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 05:38:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 67. [2024-10-13 05:38:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:38:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-13 05:38:31,081 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 159 [2024-10-13 05:38:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:38:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-13 05:38:31,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-13 05:38:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 05:38:31,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:31,085 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:31,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:38:31,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:31,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash -72549164, now seen corresponding path program 1 times [2024-10-13 05:38:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34677726] [2024-10-13 05:38:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:38:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:38:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:38:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:38:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:38:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:38:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:38:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:38:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:38:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:38:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:38:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:38:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:38:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:38:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 05:38:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 05:38:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 05:38:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 05:38:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 05:38:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 05:38:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 05:38:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 05:38:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 05:38:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 05:38:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 05:38:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 05:38:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:38:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 05:38:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:38:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34677726] [2024-10-13 05:38:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34677726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:38:36,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:38:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:38:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743301282] [2024-10-13 05:38:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:38:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:38:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:38:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:38:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:38:36,236 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:38:37,237 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2024-10-13 05:38:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:38:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-13 05:38:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:38:37,240 INFO L225 Difference]: With dead ends: 284 [2024-10-13 05:38:37,240 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 05:38:37,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:38:37,241 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 233 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:38:37,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 437 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:38:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 05:38:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 161. [2024-10-13 05:38:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 113 states have internal predecessors, (151), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 05:38:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2024-10-13 05:38:37,281 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 161 [2024-10-13 05:38:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:38:37,283 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2024-10-13 05:38:37,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 05:38:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2024-10-13 05:38:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 05:38:37,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:38:37,286 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:38:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:38:37,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:38:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:38:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash 607509206, now seen corresponding path program 1 times [2024-10-13 05:38:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:38:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956190988] [2024-10-13 05:38:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:38:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:38:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat