./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_floatingpointinfluence_no-floats_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_floatingpointinfluence_no-floats_file-38.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 ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:02:22,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:02:22,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:02:22,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:02:22,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:02:22,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:02:22,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:02:22,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:02:22,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:02:22,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:02:22,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:02:22,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:02:22,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:02:22,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:02:22,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:02:22,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:02:22,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:02:22,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:02:22,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:02:22,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:02:22,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:02:22,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:02:22,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:02:22,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:02:22,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:02:22,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:02:22,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:02:22,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:02:22,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:02:22,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:02:22,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:02:22,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:02:22,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:02:22,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:02:22,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:02:22,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:02:22,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:02:22,400 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 -> ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 [2024-11-20 06:02:22,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:02:22,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:02:22,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:02:22,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:02:22,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:02:22,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2024-11-20 06:02:23,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:02:23,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:02:23,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2024-11-20 06:02:24,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd56da4bf/e8929806ab584f7fa1d8901f4ed79bbc/FLAGbc902bbc8 [2024-11-20 06:02:24,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd56da4bf/e8929806ab584f7fa1d8901f4ed79bbc [2024-11-20 06:02:24,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:02:24,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:02:24,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:02:24,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:02:24,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:02:24,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5845ae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24, skipping insertion in model container [2024-11-20 06:02:24,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:02:24,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2024-11-20 06:02:24,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:02:24,294 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:02:24,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2024-11-20 06:02:24,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:02:24,339 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:02:24,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24 WrapperNode [2024-11-20 06:02:24,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:02:24,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:02:24,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:02:24,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:02:24,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,384 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-20 06:02:24,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:02:24,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:02:24,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:02:24,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:02:24,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,414 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:02:24,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:02:24,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:02:24,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:02:24,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:02:24,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (1/1) ... [2024-11-20 06:02:24,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:02:24,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:02:24,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:02:24,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:02:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:02:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:02:24,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:02:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:02:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:02:24,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:02:24,577 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:02:24,579 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:02:24,765 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 06:02:24,765 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:02:24,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:02:24,781 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:02:24,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:24 BoogieIcfgContainer [2024-11-20 06:02:24,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:02:24,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:02:24,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:02:24,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:02:24,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:02:24" (1/3) ... [2024-11-20 06:02:24,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12265548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:02:24, skipping insertion in model container [2024-11-20 06:02:24,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:24" (2/3) ... [2024-11-20 06:02:24,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12265548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:02:24, skipping insertion in model container [2024-11-20 06:02:24,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:24" (3/3) ... [2024-11-20 06:02:24,789 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-38.i [2024-11-20 06:02:24,801 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:02:24,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:02:24,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:02:24,853 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;@6093ef5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:02:24,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:02:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:02:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 06:02:24,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:24,868 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:24,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1753168494, now seen corresponding path program 1 times [2024-11-20 06:02:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923182157] [2024-11-20 06:02:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923182157] [2024-11-20 06:02:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923182157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:25,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:02:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256141887] [2024-11-20 06:02:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:25,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:02:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:02:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:02:25,308 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:02:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:25,333 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2024-11-20 06:02:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:02:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 168 [2024-11-20 06:02:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:25,343 INFO L225 Difference]: With dead ends: 127 [2024-11-20 06:02:25,344 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 06:02:25,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:02:25,351 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:25,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:02:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 06:02:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-20 06:02:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:02:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-20 06:02:25,398 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 168 [2024-11-20 06:02:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-20 06:02:25,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:02:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-20 06:02:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 06:02:25,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:25,403 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:25,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:02:25,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:25,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2025210478, now seen corresponding path program 1 times [2024-11-20 06:02:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289777563] [2024-11-20 06:02:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289777563] [2024-11-20 06:02:25,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289777563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:25,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:25,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:02:25,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349446258] [2024-11-20 06:02:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:02:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:02:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:02:25,653 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:25,704 INFO L93 Difference]: Finished difference Result 161 states and 239 transitions. [2024-11-20 06:02:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:02:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2024-11-20 06:02:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:25,707 INFO L225 Difference]: With dead ends: 161 [2024-11-20 06:02:25,707 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 06:02:25,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:02:25,709 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:25,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 174 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:02:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 06:02:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-20 06:02:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-11-20 06:02:25,726 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 168 [2024-11-20 06:02:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:25,727 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-11-20 06:02:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-11-20 06:02:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 06:02:25,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:25,729 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:25,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:02:25,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:25,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2027057520, now seen corresponding path program 1 times [2024-11-20 06:02:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:25,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740398104] [2024-11-20 06:02:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740398104] [2024-11-20 06:02:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740398104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:29,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:29,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:02:29,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887524730] [2024-11-20 06:02:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:29,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:02:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:02:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:02:29,008 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:29,396 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2024-11-20 06:02:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:02:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2024-11-20 06:02:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:29,400 INFO L225 Difference]: With dead ends: 131 [2024-11-20 06:02:29,400 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 06:02:29,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:02:29,402 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 34 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:29,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 471 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:02:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 06:02:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-11-20 06:02:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 59 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-20 06:02:29,429 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 168 [2024-11-20 06:02:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-20 06:02:29,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-20 06:02:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-20 06:02:29,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:29,432 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:02:29,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:29,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1587851406, now seen corresponding path program 1 times [2024-11-20 06:02:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391817407] [2024-11-20 06:02:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391817407] [2024-11-20 06:02:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391817407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:02:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440564645] [2024-11-20 06:02:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:31,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:02:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:02:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:02:31,544 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:31,793 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2024-11-20 06:02:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:02:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2024-11-20 06:02:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:31,796 INFO L225 Difference]: With dead ends: 134 [2024-11-20 06:02:31,796 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 06:02:31,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:02:31,797 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 41 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:31,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 469 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:02:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 06:02:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2024-11-20 06:02:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-20 06:02:31,817 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 168 [2024-11-20 06:02:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:31,821 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-20 06:02:31,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-20 06:02:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 06:02:31,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:31,823 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:02:31,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1797022649, now seen corresponding path program 1 times [2024-11-20 06:02:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698225682] [2024-11-20 06:02:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698225682] [2024-11-20 06:02:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698225682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:37,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:37,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:02:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429510481] [2024-11-20 06:02:37,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:02:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:37,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:02:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:02:37,075 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:37,605 INFO L93 Difference]: Finished difference Result 232 states and 330 transitions. [2024-11-20 06:02:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:02:37,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2024-11-20 06:02:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:37,610 INFO L225 Difference]: With dead ends: 232 [2024-11-20 06:02:37,610 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 06:02:37,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:02:37,612 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 63 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:37,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 486 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:02:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 06:02:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2024-11-20 06:02:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-20 06:02:37,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 169 [2024-11-20 06:02:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:37,623 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-20 06:02:37,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-20 06:02:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 06:02:37,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:37,625 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:02:37,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1795175607, now seen corresponding path program 1 times [2024-11-20 06:02:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841854501] [2024-11-20 06:02:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841854501] [2024-11-20 06:02:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841854501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:02:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677680699] [2024-11-20 06:02:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:02:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:02:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:02:41,454 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:41,968 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2024-11-20 06:02:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:02:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2024-11-20 06:02:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:41,970 INFO L225 Difference]: With dead ends: 137 [2024-11-20 06:02:41,970 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 06:02:41,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:02:41,971 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:41,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 494 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:02:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 06:02:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2024-11-20 06:02:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-20 06:02:41,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 169 [2024-11-20 06:02:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:41,987 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-20 06:02:41,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-20 06:02:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 06:02:41,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:41,989 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:41,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:02:41,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2104917637, now seen corresponding path program 1 times [2024-11-20 06:02:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665368803] [2024-11-20 06:02:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665368803] [2024-11-20 06:02:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665368803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:02:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36480105] [2024-11-20 06:02:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:44,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:02:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:02:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:02:44,550 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:44,892 INFO L93 Difference]: Finished difference Result 231 states and 329 transitions. [2024-11-20 06:02:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:02:44,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2024-11-20 06:02:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:44,896 INFO L225 Difference]: With dead ends: 231 [2024-11-20 06:02:44,898 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 06:02:44,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:02:44,899 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 39 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:44,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 602 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:02:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 06:02:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2024-11-20 06:02:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 06:02:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-11-20 06:02:44,911 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 169 [2024-11-20 06:02:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-11-20 06:02:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-11-20 06:02:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 06:02:44,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:44,914 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:44,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:02:44,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:44,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2106764679, now seen corresponding path program 1 times [2024-11-20 06:02:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:44,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678413952] [2024-11-20 06:02:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:02:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 06:02:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:02:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 06:02:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:02:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678413952] [2024-11-20 06:02:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678413952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:02:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704321537] [2024-11-20 06:02:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:02:47,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:47,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:02:47,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:02:47,658 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:47,949 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2024-11-20 06:02:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:02:47,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2024-11-20 06:02:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:47,950 INFO L225 Difference]: With dead ends: 114 [2024-11-20 06:02:47,950 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 06:02:47,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:02:47,951 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:47,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 364 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:02:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 06:02:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 06:02:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 06:02:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 06:02:47,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2024-11-20 06:02:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:47,952 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 06:02:47,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:02:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 06:02:47,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 06:02:47,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:02:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:02:47,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:47,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 06:02:48,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:02:48,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:02:48 BoogieIcfgContainer [2024-11-20 06:02:48,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:02:48,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:02:48,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:02:48,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:02:48,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:24" (3/4) ... [2024-11-20 06:02:48,674 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 06:02:48,677 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 06:02:48,681 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-20 06:02:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 06:02:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 06:02:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 06:02:48,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 06:02:48,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 06:02:48,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:02:48,772 INFO L158 Benchmark]: Toolchain (without parser) took 24750.83ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 93.9MB in the beginning and 354.0MB in the end (delta: -260.1MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,772 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:02:48,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.89ms. Allocated memory is still 159.4MB. Free memory was 93.6MB in the beginning and 127.4MB in the end (delta: -33.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.49ms. Allocated memory is still 159.4MB. Free memory was 127.4MB in the beginning and 124.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,773 INFO L158 Benchmark]: Boogie Preprocessor took 42.69ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 119.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,773 INFO L158 Benchmark]: RCFGBuilder took 349.42ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 100.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,773 INFO L158 Benchmark]: TraceAbstraction took 23887.45ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 99.4MB in the beginning and 360.3MB in the end (delta: -260.9MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,773 INFO L158 Benchmark]: Witness Printer took 100.08ms. Allocated memory is still 704.6MB. Free memory was 360.3MB in the beginning and 354.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 06:02:48,775 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.89ms. Allocated memory is still 159.4MB. Free memory was 93.6MB in the beginning and 127.4MB in the end (delta: -33.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.49ms. Allocated memory is still 159.4MB. Free memory was 127.4MB in the beginning and 124.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.69ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 119.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 349.42ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 100.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23887.45ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 99.4MB in the beginning and 360.3MB in the end (delta: -260.9MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. * Witness Printer took 100.08ms. Allocated memory is still 704.6MB. Free memory was 360.3MB in the beginning and 354.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 3154 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2401 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 840 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 753 mSDtfsCounter, 840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 118 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1348 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 8189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12096/12096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((var_1_13 == 0) || ((((((var_1_2 < (var_1_3 + 1)) || (var_1_1 < (((((unsigned) var_1_4 * 65535) + var_1_2) % 65536) + 1))) && ((var_1_1 < (((((unsigned) var_1_4 * 65535) + var_1_3) % 65536) + 1)) || (var_1_3 < var_1_2))) && (((((unsigned) var_1_4 * 65535) + var_1_3) / 65536) <= var_1_4)) && (((((unsigned) var_1_4 * 65535) + var_1_2) / 65536) <= var_1_4)) && (((((((unsigned) var_1_4 * 65535) + var_1_3) % 65536) <= var_1_1) && (var_1_2 <= var_1_3)) || (((var_1_3 + 1) <= var_1_2) && (((((unsigned) var_1_4 * 65535) + var_1_2) % 65536) <= var_1_1))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) RESULT: Ultimate proved your program to be correct! [2024-11-20 06:02:48,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE