./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_loopvsstraightlinecode_25-while_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_loopvsstraightlinecode_25-while_file-6.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 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:39:06,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:39:06,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:39:06,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:39:06,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:39:06,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:39:06,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:39:06,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:39:06,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:39:06,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:39:06,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:39:06,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:39:06,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:39:06,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:39:06,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:39:06,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:39:06,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:39:06,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:39:06,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:39:06,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:39:06,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:39:06,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:39:06,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:39:06,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:39:06,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:39:06,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:39:06,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:39:06,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:39:06,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:39:06,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:39:06,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:39:06,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:39:06,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:39:06,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:39:06,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:39:06,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:39:06,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:39:06,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:39:06,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:39:06,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:39:06,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:39:06,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:39:06,106 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 -> 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 [2024-10-24 09:39:06,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:39:06,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:39:06,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:39:06,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:39:06,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:39:06,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-10-24 09:39:07,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:39:07,998 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:39:07,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-10-24 09:39:08,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b5a8ea5/2aff9ce8382e4d2189ff7a8998179743/FLAG78ee022e2 [2024-10-24 09:39:08,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b5a8ea5/2aff9ce8382e4d2189ff7a8998179743 [2024-10-24 09:39:08,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:39:08,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:39:08,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:39:08,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:39:08,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:39:08,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cdd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08, skipping insertion in model container [2024-10-24 09:39:08,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:39:08,217 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_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-10-24 09:39:08,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:39:08,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:39:08,299 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_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-10-24 09:39:08,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:39:08,350 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:39:08,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08 WrapperNode [2024-10-24 09:39:08,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:39:08,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:39:08,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:39:08,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:39:08,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,395 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-24 09:39:08,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:39:08,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:39:08,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:39:08,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:39:08,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,454 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-24 09:39:08,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:39:08,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:39:08,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:39:08,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:39:08,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (1/1) ... [2024-10-24 09:39:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:39:08,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:39:08,540 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-24 09:39:08,546 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-24 09:39:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:39:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:39:08,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:39:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:39:08,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:39:08,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:39:08,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:39:08,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:39:08,921 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 09:39:08,921 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:39:08,960 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:39:08,960 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:39:08,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:39:08 BoogieIcfgContainer [2024-10-24 09:39:08,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:39:08,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:39:08,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:39:08,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:39:08,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:39:08" (1/3) ... [2024-10-24 09:39:08,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e0f2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:39:08, skipping insertion in model container [2024-10-24 09:39:08,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:39:08" (2/3) ... [2024-10-24 09:39:08,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e0f2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:39:08, skipping insertion in model container [2024-10-24 09:39:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:39:08" (3/3) ... [2024-10-24 09:39:08,969 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-10-24 09:39:08,984 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:39:08,984 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:39:09,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:39:09,045 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;@5d758269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:39:09,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:39:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:39:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:39:09,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:39:09,062 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:39:09,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:39:09,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:39:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1158419451, now seen corresponding path program 1 times [2024-10-24 09:39:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:39:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030476828] [2024-10-24 09:39:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:39:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:39:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:39:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:39:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:39:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:39:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:39:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:39:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:39:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:39:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:39:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:39:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:39:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:39:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:39:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:39:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:39:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:39:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:39:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:39:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:39:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:39:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:39:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030476828] [2024-10-24 09:39:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030476828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:39:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:39:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:39:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434059130] [2024-10-24 09:39:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:39:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:39:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:39:09,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:39:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:39:09,510 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:39:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:39:09,558 INFO L93 Difference]: Finished difference Result 93 states and 167 transitions. [2024-10-24 09:39:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:39:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-24 09:39:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:39:09,569 INFO L225 Difference]: With dead ends: 93 [2024-10-24 09:39:09,570 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:39:09,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-24 09:39:09,578 INFO L432 NwaCegarLoop]: 67 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, 67 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-24 09:39:09,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:39:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:39:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:39:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:39:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2024-10-24 09:39:09,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 114 [2024-10-24 09:39:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:39:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2024-10-24 09:39:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:39:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2024-10-24 09:39:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:39:09,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:39:09,637 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:39:09,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:39:09,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:39:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:39:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 528066503, now seen corresponding path program 1 times [2024-10-24 09:39:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:39:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113884523] [2024-10-24 09:39:09,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:39:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:39:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:39:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:39:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:39:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:39:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:39:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:39:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:39:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:39:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:39:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:39:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:39:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:39:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:39:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:39:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:39:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:39:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:39:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:39:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:39:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:39:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:39:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113884523] [2024-10-24 09:39:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113884523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:39:27,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:39:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:39:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90797131] [2024-10-24 09:39:27,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:39:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:39:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:39:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:39:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:39:27,318 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:39:31,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:39:34,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:39:38,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:39:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:39:39,481 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2024-10-24 09:39:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:39:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-24 09:39:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:39:39,486 INFO L225 Difference]: With dead ends: 77 [2024-10-24 09:39:39,486 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 09:39:39,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:39:39,488 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:39:39,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 237 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2024-10-24 09:39:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 09:39:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2024-10-24 09:39:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:39:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-24 09:39:39,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 114 [2024-10-24 09:39:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:39:39,505 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-24 09:39:39,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:39:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-24 09:39:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:39:39,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:39:39,507 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:39:39,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:39:39,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:39:39,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:39:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 528006921, now seen corresponding path program 1 times [2024-10-24 09:39:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:39:39,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428060287] [2024-10-24 09:39:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:39:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:39:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:39:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:39:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:39:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:39:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:39:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:39:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:39:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:39:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:39:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:39:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:39:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:39:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:39:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:39:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:39:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:39:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:39:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:39:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:39:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:39:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:39:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:39:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428060287] [2024-10-24 09:39:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428060287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:39:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:39:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 09:39:58,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294165151] [2024-10-24 09:39:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:39:58,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 09:39:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:39:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 09:39:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:39:58,668 INFO L87 Difference]: Start difference. First operand 51 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:40:06,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:40:11,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:40:14,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:40:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:40:18,502 INFO L93 Difference]: Finished difference Result 139 states and 199 transitions. [2024-10-24 09:40:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:40:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2024-10-24 09:40:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:40:18,505 INFO L225 Difference]: With dead ends: 139 [2024-10-24 09:40:18,505 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 09:40:18,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-10-24 09:40:18,507 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 181 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 97 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:40:18,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 293 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2024-10-24 09:40:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 09:40:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 97. [2024-10-24 09:40:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 09:40:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-24 09:40:18,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 114 [2024-10-24 09:40:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:40:18,532 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-24 09:40:18,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 09:40:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-24 09:40:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:40:18,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:40:18,534 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:40:18,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:40:18,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:40:18,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:40:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash 529913545, now seen corresponding path program 1 times [2024-10-24 09:40:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:40:18,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645319159] [2024-10-24 09:40:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:40:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:40:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:40:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:40:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:40:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:40:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:40:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:40:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:40:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:40:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:40:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:40:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:40:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:40:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:40:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:40:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:40:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:40:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:40:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:40:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:40:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:40:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:40:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645319159] [2024-10-24 09:40:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645319159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:40:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:40:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:40:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765363080] [2024-10-24 09:40:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:40:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:40:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:40:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:40:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:40:34,311 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:40:36,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:40:40,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 09:40:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:40:40,162 INFO L93 Difference]: Finished difference Result 125 states and 190 transitions. [2024-10-24 09:40:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:40:40,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 114 [2024-10-24 09:40:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:40:40,166 INFO L225 Difference]: With dead ends: 125 [2024-10-24 09:40:40,166 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 09:40:40,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:40:40,167 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:40:40,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 185 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 09:40:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 09:40:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 51. [2024-10-24 09:40:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 09:40:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 78 transitions. [2024-10-24 09:40:40,188 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 78 transitions. Word has length 114 [2024-10-24 09:40:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:40:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 78 transitions. [2024-10-24 09:40:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:40:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 78 transitions. [2024-10-24 09:40:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:40:40,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:40:40,193 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:40:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:40:40,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:40:40,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:40:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 100902162, now seen corresponding path program 1 times [2024-10-24 09:40:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:40:40,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732701705] [2024-10-24 09:40:40,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:40:40,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:40:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:40:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:40:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:40:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:40:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 09:40:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:40:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:40:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:40:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:40:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:40:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:40:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:40:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:40:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:40:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:40:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:40:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:40:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:40:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:40:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:40:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 09:40:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:40:40,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732701705] [2024-10-24 09:40:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732701705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:40:40,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:40:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:40:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171190854] [2024-10-24 09:40:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:40:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:40:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:40:40,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:40:40,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:40:40,458 INFO L87 Difference]: Start difference. First operand 51 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:40:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:40:40,719 INFO L93 Difference]: Finished difference Result 166 states and 254 transitions. [2024-10-24 09:40:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:40:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 115 [2024-10-24 09:40:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:40:40,722 INFO L225 Difference]: With dead ends: 166 [2024-10-24 09:40:40,724 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 09:40:40,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:40:40,725 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:40:40,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:40:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 09:40:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2024-10-24 09:40:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 09:40:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-24 09:40:40,755 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 115 [2024-10-24 09:40:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:40:40,756 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-24 09:40:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 09:40:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-24 09:40:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:40:40,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:40:40,760 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:40:40,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:40:40,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:40:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:40:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1875909524, now seen corresponding path program 1 times [2024-10-24 09:40:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:40:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728829071] [2024-10-24 09:40:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:40:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:40:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat