./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.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_fillercode_fillercodestructure_filler-ps-cn_file-45.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 9f2334f2a5280c6f8bd58fdc7714429a303d87a42c4cda26bddf4d9076f15b03 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:53:36,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:53:36,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:53:36,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:53:36,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:53:36,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:53:36,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:53:36,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:53:36,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:53:36,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:53:36,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:53:36,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:53:36,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:53:36,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:53:36,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:53:36,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:53:36,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:53:36,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:53:36,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:53:36,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:53:36,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:53:36,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:53:36,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:53:36,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:53:36,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:53:36,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:53:36,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:53:36,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:53:36,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:53:36,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:53:36,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:53:36,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:53:36,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:53:36,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:53:36,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:53:36,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:53:36,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:53:36,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:53:36,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:53:36,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:53:36,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:53:36,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:53:36,879 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 -> 9f2334f2a5280c6f8bd58fdc7714429a303d87a42c4cda26bddf4d9076f15b03 [2024-10-13 02:53:37,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:53:37,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:53:37,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:53:37,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:53:37,175 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:53:37,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i [2024-10-13 02:53:38,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:53:38,912 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:53:38,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i [2024-10-13 02:53:38,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be105ed4f/95a8cf3372644147aed9743332354ed4/FLAGb5fd8fb65 [2024-10-13 02:53:38,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be105ed4f/95a8cf3372644147aed9743332354ed4 [2024-10-13 02:53:38,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:53:38,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:53:38,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:53:38,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:53:38,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:53:38,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:53:38" (1/1) ... [2024-10-13 02:53:38,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785e5ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:38, skipping insertion in model container [2024-10-13 02:53:38,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:53:38" (1/1) ... [2024-10-13 02:53:39,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:53:39,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i[919,932] [2024-10-13 02:53:39,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:53:39,349 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:53:39,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i[919,932] [2024-10-13 02:53:39,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:53:39,438 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:53:39,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39 WrapperNode [2024-10-13 02:53:39,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:53:39,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:53:39,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:53:39,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:53:39,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,514 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-10-13 02:53:39,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:53:39,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:53:39,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:53:39,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:53:39,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,590 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 02:53:39,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:53:39,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:53:39,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:53:39,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:53:39,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (1/1) ... [2024-10-13 02:53:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:53:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:53:39,700 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 02:53:39,704 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 02:53:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:53:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:53:39,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:53:39,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:53:39,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:53:39,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:53:39,882 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:53:39,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:53:40,387 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:53:40,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:53:40,445 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:53:40,446 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:53:40,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:53:40 BoogieIcfgContainer [2024-10-13 02:53:40,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:53:40,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:53:40,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:53:40,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:53:40,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:53:38" (1/3) ... [2024-10-13 02:53:40,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c111643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:53:40, skipping insertion in model container [2024-10-13 02:53:40,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:53:39" (2/3) ... [2024-10-13 02:53:40,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c111643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:53:40, skipping insertion in model container [2024-10-13 02:53:40,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:53:40" (3/3) ... [2024-10-13 02:53:40,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-45.i [2024-10-13 02:53:40,476 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:53:40,477 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:53:40,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:53:40,551 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;@e382c21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:53:40,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:53:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-13 02:53:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 02:53:40,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:53:40,578 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:53:40,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:53:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:53:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1413274429, now seen corresponding path program 1 times [2024-10-13 02:53:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:53:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904211893] [2024-10-13 02:53:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:53:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:53:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:53:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:53:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:53:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:53:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:53:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:53:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:53:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:53:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:53:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:53:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:53:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:53:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:53:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:53:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:53:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:53:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:53:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:53:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:53:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:53:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:53:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:53:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:53:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:53:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:53:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:53:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:53:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:53:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:53:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:53:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:53:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:53:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:53:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:53:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:53:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 02:53:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:53:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 02:53:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:53:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:53:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-10-13 02:53:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:53:41,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904211893] [2024-10-13 02:53:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904211893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:53:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:53:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:53:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787838660] [2024-10-13 02:53:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:53:41,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:53:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:53:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:53:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:53:41,374 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-13 02:53:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:53:41,445 INFO L93 Difference]: Finished difference Result 199 states and 365 transitions. [2024-10-13 02:53:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:53:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 251 [2024-10-13 02:53:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:53:41,463 INFO L225 Difference]: With dead ends: 199 [2024-10-13 02:53:41,463 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 02:53:41,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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 02:53:41,474 INFO L432 NwaCegarLoop]: 155 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, 155 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 02:53:41,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:53:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 02:53:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 02:53:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-13 02:53:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 158 transitions. [2024-10-13 02:53:41,555 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 158 transitions. Word has length 251 [2024-10-13 02:53:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:53:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 158 transitions. [2024-10-13 02:53:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-13 02:53:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2024-10-13 02:53:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 02:53:41,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:53:41,562 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:53:41,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:53:41,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:53:41,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:53:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -880688781, now seen corresponding path program 1 times [2024-10-13 02:53:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:53:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459612154] [2024-10-13 02:53:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:53:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:53:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:53:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:53:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:53:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:53:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:53:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:53:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:53:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:53:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:53:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:53:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:53:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:53:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:53:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:53:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:53:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:53:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:53:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:53:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:53:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:53:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:53:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:53:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:53:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:53:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:41,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:53:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:53:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:53:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:53:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:53:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:53:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:53:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:53:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:53:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:53:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:53:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:53:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 02:53:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:53:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 02:53:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:53:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:53:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-10-13 02:53:42,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:53:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459612154] [2024-10-13 02:53:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459612154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:53:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:53:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:53:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205944051] [2024-10-13 02:53:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:53:42,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:53:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:53:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:53:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:53:42,108 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:53:42,199 INFO L93 Difference]: Finished difference Result 252 states and 401 transitions. [2024-10-13 02:53:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:53:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2024-10-13 02:53:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:53:42,208 INFO L225 Difference]: With dead ends: 252 [2024-10-13 02:53:42,208 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 02:53:42,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-13 02:53:42,212 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 87 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:53:42,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 334 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:53:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 02:53:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-13 02:53:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 92 states have internal predecessors, (127), 57 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-13 02:53:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2024-10-13 02:53:42,262 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 251 [2024-10-13 02:53:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:53:42,265 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2024-10-13 02:53:42,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2024-10-13 02:53:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 02:53:42,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:53:42,273 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:53:42,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:53:42,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:53:42,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:53:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash -457986955, now seen corresponding path program 1 times [2024-10-13 02:53:42,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:53:42,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135532089] [2024-10-13 02:53:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:53:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:53:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:53:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:53:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:53:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:53:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:53:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:53:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:53:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:53:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:53:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:53:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:53:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:53:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:53:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:53:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:53:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:53:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:53:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:53:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:53:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:53:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:53:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:53:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:53:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:53:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:53:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:53:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:53:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:53:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:53:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:53:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:53:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:53:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:53:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:53:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:53:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:53:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 02:53:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:53:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 02:53:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:53:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:53:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-10-13 02:53:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:53:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135532089] [2024-10-13 02:53:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135532089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:53:42,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:53:42,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:53:42,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552845002] [2024-10-13 02:53:42,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:53:42,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:53:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:53:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:53:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:53:42,736 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:53:42,834 INFO L93 Difference]: Finished difference Result 445 states and 709 transitions. [2024-10-13 02:53:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:53:42,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251 [2024-10-13 02:53:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:53:42,842 INFO L225 Difference]: With dead ends: 445 [2024-10-13 02:53:42,844 INFO L226 Difference]: Without dead ends: 295 [2024-10-13 02:53:42,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-13 02:53:42,847 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 147 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:53:42,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 306 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:53:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-13 02:53:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2024-10-13 02:53:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 174 states have (on average 1.3448275862068966) internal successors, (234), 176 states have internal predecessors, (234), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-13 02:53:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 462 transitions. [2024-10-13 02:53:42,922 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 462 transitions. Word has length 251 [2024-10-13 02:53:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:53:42,923 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 462 transitions. [2024-10-13 02:53:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 462 transitions. [2024-10-13 02:53:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-13 02:53:42,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:53:42,928 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:53:42,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:53:42,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:53:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:53:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1636869606, now seen corresponding path program 1 times [2024-10-13 02:53:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:53:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560115639] [2024-10-13 02:53:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:53:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:53:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:53:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:53:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:53:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:53:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:53:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:53:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:53:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:53:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:53:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:53:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:53:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:53:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:53:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 02:53:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 02:53:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 02:53:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:53:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 02:53:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:53:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:53:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:53:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:53:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:53:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:53:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:53:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:53:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:53:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:53:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:53:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:53:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 02:53:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:53:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 02:53:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 02:53:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 02:53:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:53:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 02:53:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:53:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 02:53:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:53:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 02:53:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:53:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-10-13 02:53:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:53:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560115639] [2024-10-13 02:53:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560115639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:53:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:53:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:53:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123054850] [2024-10-13 02:53:43,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:53:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:53:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:53:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:53:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:53:43,481 INFO L87 Difference]: Start difference. First operand 293 states and 462 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:53:43,568 INFO L93 Difference]: Finished difference Result 877 states and 1384 transitions. [2024-10-13 02:53:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:53:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252 [2024-10-13 02:53:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:53:43,576 INFO L225 Difference]: With dead ends: 877 [2024-10-13 02:53:43,576 INFO L226 Difference]: Without dead ends: 585 [2024-10-13 02:53:43,578 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-13 02:53:43,579 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:53:43,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:53:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-13 02:53:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 581. [2024-10-13 02:53:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 344 states have (on average 1.3313953488372092) internal successors, (458), 348 states have internal predecessors, (458), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-10-13 02:53:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 914 transitions. [2024-10-13 02:53:43,686 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 914 transitions. Word has length 252 [2024-10-13 02:53:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:53:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 914 transitions. [2024-10-13 02:53:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-10-13 02:53:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 914 transitions. [2024-10-13 02:53:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-13 02:53:43,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:53:43,695 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:53:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:53:43,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:53:43,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:53:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1637029336, now seen corresponding path program 1 times [2024-10-13 02:53:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:53:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009889780] [2024-10-13 02:53:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:53:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:53:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat