./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_fillercodesize_ps-cn-25_file-28.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 c9ef5ba1706ac871887032b03f34be305eba98b549af8f4e64ec3eb7f553dee0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:37:53,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:37:53,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:37:53,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:37:53,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:37:53,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:37:53,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:37:53,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:37:53,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:37:53,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:37:53,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:37:53,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:37:53,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:37:53,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:37:53,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:37:53,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:37:53,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:37:53,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:37:53,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:37:53,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:37:53,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:37:53,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:37:53,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:37:53,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:37:53,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:37:53,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:37:53,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:37:53,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:37:53,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:37:53,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:37:53,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:37:53,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:37:53,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:37:53,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:37:53,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:37:53,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:37:53,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:37:53,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:37:53,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:37:53,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:37:53,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:37:53,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:37:53,441 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 -> c9ef5ba1706ac871887032b03f34be305eba98b549af8f4e64ec3eb7f553dee0 [2024-11-08 20:37:53,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:37:53,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:37:53,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:37:53,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:37:53,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:37:53,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-08 20:37:55,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:37:55,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:37:55,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-08 20:37:55,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b414dc8c5/ae6675490ee140b4a839abe576307d7a/FLAG8e88c8230 [2024-11-08 20:37:55,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b414dc8c5/ae6675490ee140b4a839abe576307d7a [2024-11-08 20:37:55,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:37:55,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:37:55,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:37:55,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:37:55,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:37:55,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:55,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55, skipping insertion in model container [2024-11-08 20:37:55,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:55,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:37:55,710 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_fillercodesize_ps-cn-25_file-28.i[915,928] [2024-11-08 20:37:55,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:37:55,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:37:55,824 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_fillercodesize_ps-cn-25_file-28.i[915,928] [2024-11-08 20:37:55,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:37:55,893 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:37:55,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55 WrapperNode [2024-11-08 20:37:55,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:37:55,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:37:55,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:37:55,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:37:55,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:55,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:55,992 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-11-08 20:37:55,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:37:55,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:37:55,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:37:55,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:37:56,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,081 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-08 20:37:56,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:37:56,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:37:56,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:37:56,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:37:56,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (1/1) ... [2024-11-08 20:37:56,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:37:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:37:56,186 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-08 20:37:56,189 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-08 20:37:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:37:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:37:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:37:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:37:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:37:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:37:56,336 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:37:56,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:37:56,801 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 20:37:56,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:37:56,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:37:56,820 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:37:56,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:37:56 BoogieIcfgContainer [2024-11-08 20:37:56,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:37:56,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:37:56,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:37:56,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:37:56,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:37:55" (1/3) ... [2024-11-08 20:37:56,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4419d7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:37:56, skipping insertion in model container [2024-11-08 20:37:56,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:37:55" (2/3) ... [2024-11-08 20:37:56,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4419d7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:37:56, skipping insertion in model container [2024-11-08 20:37:56,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:37:56" (3/3) ... [2024-11-08 20:37:56,830 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-08 20:37:56,847 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:37:56,847 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:37:56,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:37:56,925 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;@4e5dd875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:37:56,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:37:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 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-11-08 20:37:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 20:37:56,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:37:56,943 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, 1, 1, 1, 1, 1, 1] [2024-11-08 20:37:56,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:37:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:37:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -247435510, now seen corresponding path program 1 times [2024-11-08 20:37:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:37:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761532224] [2024-11-08 20:37:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:37:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:37:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:37:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:37:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:37:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:37:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:37:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:37:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:37:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:37:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:37:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:37:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:37:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:37:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:37:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:37:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:37:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:37:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:37:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:37:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:37:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:37:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:37:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:37:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:37:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:37:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:37:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:37:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:37:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:37:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:37:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 20:37:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:37:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:37:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:37:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 20:37:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:37:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 20:37:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:37:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-08 20:37:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:37:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-08 20:37:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-08 20:37:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-08 20:37:57,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:37:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761532224] [2024-11-08 20:37:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761532224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:37:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:37:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:37:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7583448] [2024-11-08 20:37:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:37:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:37:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:37:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:37:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:37:57,631 INFO L87 Difference]: Start difference. First operand has 114 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-11-08 20:37:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:37:57,680 INFO L93 Difference]: Finished difference Result 221 states and 387 transitions. [2024-11-08 20:37:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:37:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 258 [2024-11-08 20:37:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:37:57,691 INFO L225 Difference]: With dead ends: 221 [2024-11-08 20:37:57,694 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 20:37:57,700 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-11-08 20:37:57,703 INFO L432 NwaCegarLoop]: 169 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, 169 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-08 20:37:57,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:37:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 20:37:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 20:37:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 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-11-08 20:37:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2024-11-08 20:37:57,761 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 258 [2024-11-08 20:37:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:37:57,761 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2024-11-08 20:37:57,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-11-08 20:37:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2024-11-08 20:37:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 20:37:57,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:37:57,768 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, 1, 1, 1, 1, 1, 1] [2024-11-08 20:37:57,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:37:57,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:37:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:37:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash -775828672, now seen corresponding path program 1 times [2024-11-08 20:37:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:37:57,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819361292] [2024-11-08 20:37:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:37:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:37:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:37:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:37:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:37:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:37:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:37:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:37:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:37:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:37:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:37:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:37:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:37:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:37:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:37:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:37:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:37:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:37:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:37:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:37:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:37:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:37:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 20:37:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:37:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:37:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:37:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:37:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:37:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:37:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:37:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:37:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 20:37:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:37:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 20:37:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:37:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 20:37:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:37:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 20:37:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:37:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-08 20:37:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:37:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-08 20:37:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-08 20:37:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:37:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-08 20:37:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:37:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819361292] [2024-11-08 20:37:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819361292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:37:58,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:37:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:37:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672853747] [2024-11-08 20:37:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:37:58,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:37:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:37:58,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:37:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:37:58,479 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-08 20:37:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:37:58,689 INFO L93 Difference]: Finished difference Result 303 states and 459 transitions. [2024-11-08 20:37:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:37:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 258 [2024-11-08 20:37:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:37:58,700 INFO L225 Difference]: With dead ends: 303 [2024-11-08 20:37:58,700 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 20:37:58,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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-08 20:37:58,702 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 197 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:37:58,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 493 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:37:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 20:37:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-08 20:37:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 124 states have internal predecessors, (159), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-08 20:37:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 289 transitions. [2024-11-08 20:37:58,758 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 289 transitions. Word has length 258 [2024-11-08 20:37:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:37:58,761 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 289 transitions. [2024-11-08 20:37:58,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-11-08 20:37:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 289 transitions. [2024-11-08 20:37:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 20:37:58,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:37:58,768 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, 1, 1, 1, 1, 1, 1] [2024-11-08 20:37:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:37:58,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:37:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:37:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -909842178, now seen corresponding path program 1 times [2024-11-08 20:37:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:37:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092223865] [2024-11-08 20:37:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:37:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:37:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat