./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.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 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:52:14,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:52:14,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:52:14,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:52:14,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:52:14,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:52:14,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:52:14,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:52:14,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:52:14,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:52:14,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:52:14,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:52:14,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:52:14,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:52:14,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:52:14,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:52:14,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:52:14,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:52:14,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:52:14,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:52:14,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:52:14,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:52:14,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:52:14,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:52:14,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:52:14,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:52:14,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:52:14,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:52:14,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:52:14,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:52:14,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:52:14,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:52:14,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:52:14,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:52:14,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:52:14,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:52:14,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:52:14,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:52:14,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:52:14,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:52:14,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:52:14,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:52:14,279 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 -> 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 [2024-10-14 08:52:14,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:52:14,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:52:14,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:52:14,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:52:14,553 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:52:14,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-10-14 08:52:16,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:52:16,254 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:52:16,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-10-14 08:52:16,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1cb7031/88de71579c984ba192d7b355a0940c51/FLAG84e4bb4c7 [2024-10-14 08:52:16,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1cb7031/88de71579c984ba192d7b355a0940c51 [2024-10-14 08:52:16,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:52:16,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:52:16,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:52:16,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:52:16,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:52:16,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b3db3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16, skipping insertion in model container [2024-10-14 08:52:16,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:52:16,488 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2024-10-14 08:52:16,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:52:16,606 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:52:16,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2024-10-14 08:52:16,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:52:16,698 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:52:16,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16 WrapperNode [2024-10-14 08:52:16,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:52:16,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:52:16,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:52:16,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:52:16,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,786 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-14 08:52:16,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:52:16,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:52:16,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:52:16,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:52:16,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 08:52:16,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:52:16,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:52:16,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:52:16,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:52:16,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (1/1) ... [2024-10-14 08:52:16,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:52:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:52:16,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:52:16,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:52:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:52:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:52:16,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:52:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:52:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:52:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:52:17,072 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:52:17,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:52:17,653 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-14 08:52:17,653 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:52:17,702 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:52:17,703 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:52:17,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:52:17 BoogieIcfgContainer [2024-10-14 08:52:17,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:52:17,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:52:17,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:52:17,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:52:17,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:52:16" (1/3) ... [2024-10-14 08:52:17,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431189b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:52:17, skipping insertion in model container [2024-10-14 08:52:17,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:52:16" (2/3) ... [2024-10-14 08:52:17,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431189b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:52:17, skipping insertion in model container [2024-10-14 08:52:17,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:52:17" (3/3) ... [2024-10-14 08:52:17,716 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2024-10-14 08:52:17,740 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:52:17,740 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:52:17,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:52:17,819 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;@2d0ba0bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:52:17,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:52:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 08:52:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-14 08:52:17,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:52:17,846 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:52:17,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:52:17,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:52:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1300775730, now seen corresponding path program 1 times [2024-10-14 08:52:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:52:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365593536] [2024-10-14 08:52:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:52:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:52:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:52:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:52:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:52:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:52:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:52:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:52:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:52:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:52:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:52:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:52:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 08:52:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:52:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 08:52:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:52:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:52:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:52:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:52:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:52:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:52:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:52:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:52:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:52:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:52:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:52:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:52:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:52:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:52:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 08:52:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:52:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 08:52:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:52:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-14 08:52:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:52:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:52:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:52:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 08:52:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:52:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 08:52:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:52:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 08:52:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 08:52:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 08:52:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-14 08:52:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:52:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365593536] [2024-10-14 08:52:18,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365593536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:52:18,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:52:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:52:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996860696] [2024-10-14 08:52:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:52:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:52:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:52:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:52:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:52:18,493 INFO L87 Difference]: Start difference. First operand has 106 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 08:52:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:52:18,548 INFO L93 Difference]: Finished difference Result 207 states and 380 transitions. [2024-10-14 08:52:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:52:18,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 253 [2024-10-14 08:52:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:52:18,568 INFO L225 Difference]: With dead ends: 207 [2024-10-14 08:52:18,569 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 08:52:18,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:52:18,578 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:52:18,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:52:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 08:52:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-14 08:52:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 08:52:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 160 transitions. [2024-10-14 08:52:18,641 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 160 transitions. Word has length 253 [2024-10-14 08:52:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:52:18,641 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 160 transitions. [2024-10-14 08:52:18,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-14 08:52:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 160 transitions. [2024-10-14 08:52:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-14 08:52:18,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:52:18,648 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:52:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:52:18,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:52:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:52:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1623257418, now seen corresponding path program 1 times [2024-10-14 08:52:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:52:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728710912] [2024-10-14 08:52:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:52:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:52:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:52:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:52:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:52:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:52:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:52:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:52:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:52:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:52:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:52:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:52:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 08:52:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:52:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 08:52:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:52:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:52:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:52:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:52:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:52:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:52:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:52:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:52:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:52:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:52:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:52:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:52:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:52:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:52:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 08:52:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:52:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 08:52:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:52:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-14 08:52:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:52:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:52:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:52:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 08:52:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:52:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 08:52:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:52:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 08:52:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 08:52:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 08:52:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-14 08:52:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:52:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728710912] [2024-10-14 08:52:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728710912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:52:20,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:52:20,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:52:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583629005] [2024-10-14 08:52:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:52:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:52:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:52:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:52:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:52:20,102 INFO L87 Difference]: Start difference. First operand 102 states and 160 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-14 08:52:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:52:20,563 INFO L93 Difference]: Finished difference Result 309 states and 486 transitions. [2024-10-14 08:52:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:52:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 253 [2024-10-14 08:52:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:52:20,568 INFO L225 Difference]: With dead ends: 309 [2024-10-14 08:52:20,569 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 08:52:20,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-10-14 08:52:20,571 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 08:52:20,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 420 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 08:52:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 08:52:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 195. [2024-10-14 08:52:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 08:52:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 308 transitions. [2024-10-14 08:52:20,630 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 308 transitions. Word has length 253 [2024-10-14 08:52:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:52:20,634 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 308 transitions. [2024-10-14 08:52:20,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-14 08:52:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 308 transitions. [2024-10-14 08:52:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-14 08:52:20,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:52:20,639 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:52:20,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:52:20,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:52:20,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:52:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1688172727, now seen corresponding path program 1 times [2024-10-14 08:52:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:52:20,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127071906] [2024-10-14 08:52:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:52:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:52:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:52:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 08:52:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 08:52:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:52:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:52:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:52:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:52:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:52:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:52:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 08:52:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 08:52:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 08:52:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 08:52:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 08:52:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:52:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 08:52:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:52:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:52:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:52:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:52:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:52:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:52:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:52:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:52:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:52:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 08:52:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 08:52:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 08:52:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 08:52:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 08:52:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 08:52:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-14 08:52:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 08:52:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 08:52:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-14 08:52:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 08:52:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 08:52:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 08:52:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 08:52:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 08:52:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 08:52:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 08:52:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:52:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-10-14 08:52:21,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:52:21,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127071906] [2024-10-14 08:52:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127071906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:52:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:52:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:52:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174389085] [2024-10-14 08:52:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:52:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:52:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:52:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:52:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:52:21,135 INFO L87 Difference]: Start difference. First operand 195 states and 308 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-14 08:52:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:52:21,419 INFO L93 Difference]: Finished difference Result 318 states and 497 transitions. [2024-10-14 08:52:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:52:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 254 [2024-10-14 08:52:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:52:21,426 INFO L225 Difference]: With dead ends: 318 [2024-10-14 08:52:21,426 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 08:52:21,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-10-14 08:52:21,428 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 95 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:52:21,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 425 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:52:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 08:52:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2024-10-14 08:52:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.2844036697247707) internal successors, (140), 109 states have internal predecessors, (140), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 08:52:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 308 transitions. [2024-10-14 08:52:21,489 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 308 transitions. Word has length 254 [2024-10-14 08:52:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:52:21,490 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 308 transitions. [2024-10-14 08:52:21,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-10-14 08:52:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 308 transitions. [2024-10-14 08:52:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-14 08:52:21,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:52:21,497 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:52:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:52:21,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:52:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:52:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1474629011, now seen corresponding path program 1 times [2024-10-14 08:52:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:52:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413008569] [2024-10-14 08:52:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:52:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:52:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat