./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.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 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:55:52,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:55:52,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:55:52,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:55:52,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:55:52,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:55:52,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:55:52,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:55:52,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:55:52,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:55:52,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:55:52,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:55:52,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:55:52,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:55:52,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:55:52,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:55:52,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:55:52,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:55:52,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:55:52,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:55:52,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:55:52,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:55:52,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:55:52,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:55:52,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:55:52,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:55:52,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:55:52,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:55:52,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:55:52,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:55:52,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:55:52,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:55:52,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:55:52,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:55:52,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:55:52,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:55:52,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:55:52,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:55:52,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:55:52,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:55:52,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:55:52,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:55:52,219 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 -> 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 [2024-11-12 03:55:52,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:55:52,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:55:52,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:55:52,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:55:52,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:55:52,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-12 03:55:53,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:55:54,223 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:55:54,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-12 03:55:54,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206a7cdec/71f1742485b040d4b2f31062a4f06e07/FLAG310ca143a [2024-11-12 03:55:54,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206a7cdec/71f1742485b040d4b2f31062a4f06e07 [2024-11-12 03:55:54,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:55:54,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:55:54,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:55:54,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:55:54,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:55:54,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725e636f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54, skipping insertion in model container [2024-11-12 03:55:54,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:55:54,469 WARN L250 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-ci_file-54.i[919,932] [2024-11-12 03:55:54,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:55:54,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:55:54,602 WARN L250 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-ci_file-54.i[919,932] [2024-11-12 03:55:54,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:55:54,661 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:55:54,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54 WrapperNode [2024-11-12 03:55:54,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:55:54,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:55:54,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:55:54,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:55:54,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,726 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-12 03:55:54,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:55:54,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:55:54,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:55:54,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:55:54,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,781 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-11-12 03:55:54,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:55:54,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:55:54,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:55:54,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:55:54,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (1/1) ... [2024-11-12 03:55:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:55:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:55:54,849 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-11-12 03:55:54,855 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-11-12 03:55:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:55:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:55:54,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:55:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:55:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:55:54,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:55:55,005 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:55:55,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:55:55,415 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 03:55:55,415 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:55:55,427 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:55:55,428 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:55:55,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:55:55 BoogieIcfgContainer [2024-11-12 03:55:55,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:55:55,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:55:55,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:55:55,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:55:55,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:55:54" (1/3) ... [2024-11-12 03:55:55,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8435e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:55:55, skipping insertion in model container [2024-11-12 03:55:55,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:54" (2/3) ... [2024-11-12 03:55:55,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8435e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:55:55, skipping insertion in model container [2024-11-12 03:55:55,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:55:55" (3/3) ... [2024-11-12 03:55:55,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-12 03:55:55,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:55:55,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:55:55,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:55:55,540 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;@79029ea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:55:55,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:55:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 03:55:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:55:55,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:55:55,559 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:55:55,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:55:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:55:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1434156324, now seen corresponding path program 1 times [2024-11-12 03:55:55,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:55:55,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220240325] [2024-11-12 03:55:55,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:55:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:55:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:55:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:55:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:55:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:55:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:55:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:55:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:55:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 03:55:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:55:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 03:55:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:55:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 03:55:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:55:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:55:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:55:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:55:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:55:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:55:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:55:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:55:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:55:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:55:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:55:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:55:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 03:55:56,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:55:56,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220240325] [2024-11-12 03:55:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220240325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:55:56,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:55:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:55:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496656305] [2024-11-12 03:55:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:55:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:55:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:55:56,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:55:56,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:55:56,200 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 03:55:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:55:56,233 INFO L93 Difference]: Finished difference Result 163 states and 285 transitions. [2024-11-12 03:55:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:55:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-12 03:55:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:55:56,243 INFO L225 Difference]: With dead ends: 163 [2024-11-12 03:55:56,244 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 03:55:56,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-11-12 03:55:56,252 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:55:56,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:55:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 03:55:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 03:55:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 03:55:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-12 03:55:56,301 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 167 [2024-11-12 03:55:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:55:56,302 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-12 03:55:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 03:55:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-12 03:55:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:55:56,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:55:56,306 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:55:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:55:56,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:55:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:55:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -783815582, now seen corresponding path program 1 times [2024-11-12 03:55:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:55:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144918617] [2024-11-12 03:55:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:55:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:55:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:55:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:55:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:55:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:55:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:55:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:55:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:55:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 03:55:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:55:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 03:55:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:55:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 03:55:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:55:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:55:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:55:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:55:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:55:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:55:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:55:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:55:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:55:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:55:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:55:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:55:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 03:55:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:55:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144918617] [2024-11-12 03:55:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144918617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:55:56,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:55:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:55:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397071369] [2024-11-12 03:55:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:55:56,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:55:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:55:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:55:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:55:56,901 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:55:57,085 INFO L93 Difference]: Finished difference Result 220 states and 339 transitions. [2024-11-12 03:55:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:55:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 03:55:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:55:57,089 INFO L225 Difference]: With dead ends: 220 [2024-11-12 03:55:57,089 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 03:55:57,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:55:57,094 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 108 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:55:57,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 321 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:55:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 03:55:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2024-11-12 03:55:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 03:55:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-12 03:55:57,126 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 167 [2024-11-12 03:55:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:55:57,127 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-12 03:55:57,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-12 03:55:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:55:57,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:55:57,134 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:55:57,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:55:57,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:55:57,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:55:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1220943712, now seen corresponding path program 1 times [2024-11-12 03:55:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:55:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399527605] [2024-11-12 03:55:57,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:55:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:55:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:55:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:55:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:55:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:55:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:55:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:55:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:55:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 03:55:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:55:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 03:55:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:55:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 03:55:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:55:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:55:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:55:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:55:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:55:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:55:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:55:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:55:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:55:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:55:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:55:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:55:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 03:55:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:55:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399527605] [2024-11-12 03:55:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399527605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:55:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:55:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:55:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963298399] [2024-11-12 03:55:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:55:57,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:55:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:55:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:55:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:55:57,638 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:55:57,833 INFO L93 Difference]: Finished difference Result 319 states and 497 transitions. [2024-11-12 03:55:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:55:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 03:55:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:55:57,839 INFO L225 Difference]: With dead ends: 319 [2024-11-12 03:55:57,841 INFO L226 Difference]: Without dead ends: 213 [2024-11-12 03:55:57,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:55:57,845 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 106 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:55:57,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:55:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-12 03:55:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2024-11-12 03:55:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:55:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 284 transitions. [2024-11-12 03:55:57,883 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 284 transitions. Word has length 167 [2024-11-12 03:55:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:55:57,884 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 284 transitions. [2024-11-12 03:55:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 284 transitions. [2024-11-12 03:55:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:55:57,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:55:57,889 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:55:57,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:55:57,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:55:57,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:55:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1452642644, now seen corresponding path program 1 times [2024-11-12 03:55:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:55:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617304115] [2024-11-12 03:55:57,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:55:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:55:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:55:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:55:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:55:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:55:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:55:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:55:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:55:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 03:55:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:55:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 03:55:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:55:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 03:55:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:55:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:55:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:55:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:55:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:55:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:55:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:55:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:55:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:55:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:55:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:55:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:55:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 03:55:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:55:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617304115] [2024-11-12 03:55:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617304115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:55:58,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:55:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:55:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010718342] [2024-11-12 03:55:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:55:58,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:55:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:55:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:55:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:55:58,414 INFO L87 Difference]: Start difference. First operand 183 states and 284 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:55:58,679 INFO L93 Difference]: Finished difference Result 411 states and 644 transitions. [2024-11-12 03:55:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:55:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-12 03:55:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:55:58,682 INFO L225 Difference]: With dead ends: 411 [2024-11-12 03:55:58,682 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 03:55:58,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:55:58,684 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 87 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:55:58,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 356 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:55:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 03:55:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2024-11-12 03:55:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 205 states have (on average 1.448780487804878) internal successors, (297), 207 states have internal predecessors, (297), 79 states have call successors, (79), 6 states have call predecessors, (79), 6 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-12 03:55:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 455 transitions. [2024-11-12 03:55:58,734 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 455 transitions. Word has length 168 [2024-11-12 03:55:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:55:58,735 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 455 transitions. [2024-11-12 03:55:58,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 03:55:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 455 transitions. [2024-11-12 03:55:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:55:58,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:55:58,738 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:55:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:55:58,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:55:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:55:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash 848179946, now seen corresponding path program 1 times [2024-11-12 03:55:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:55:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865013445] [2024-11-12 03:55:58,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:55:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:55:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:55:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:55:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:55:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:55:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:55:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:55:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:55:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 03:55:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:55:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 03:55:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:55:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 03:55:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:55:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:55:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:55:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:55:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:55:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:55:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:55:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:55:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:55:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:55:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:55:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:55:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 03:55:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:55:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865013445] [2024-11-12 03:55:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865013445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:55:59,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984188892] [2024-11-12 03:55:59,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:55:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:55:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:55:59,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:55:59,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:55:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:55:59,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:55:59,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:55:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-12 03:55:59,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:55:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-12 03:55:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984188892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:55:59,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:55:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 03:55:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081827493] [2024-11-12 03:55:59,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:55:59,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:55:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:55:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:55:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:55:59,854 INFO L87 Difference]: Start difference. First operand 291 states and 455 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-12 03:56:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:56:00,124 INFO L93 Difference]: Finished difference Result 532 states and 823 transitions. [2024-11-12 03:56:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:56:00,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 168 [2024-11-12 03:56:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:56:00,128 INFO L225 Difference]: With dead ends: 532 [2024-11-12 03:56:00,128 INFO L226 Difference]: Without dead ends: 309 [2024-11-12 03:56:00,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:56:00,130 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 112 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:56:00,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 254 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:56:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-12 03:56:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 303. [2024-11-12 03:56:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 214 states have (on average 1.4018691588785046) internal successors, (300), 216 states have internal predecessors, (300), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-12 03:56:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 458 transitions. [2024-11-12 03:56:00,172 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 458 transitions. Word has length 168 [2024-11-12 03:56:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:56:00,174 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 458 transitions. [2024-11-12 03:56:00,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-12 03:56:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 458 transitions. [2024-11-12 03:56:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:56:00,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:56:00,177 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 03:56:00,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:56:00,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:56:00,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:56:00,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:56:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash -740167956, now seen corresponding path program 1 times [2024-11-12 03:56:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:56:00,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670330715] [2024-11-12 03:56:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:56:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:56:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824840321] [2024-11-12 03:56:00,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:56:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:56:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:56:00,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:56:00,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 03:56:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:56:00,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 03:56:00,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:56:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 824 proven. 135 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-12 03:56:02,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:56:52,057 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 03:57:09,820 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)