./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.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 bbe8ef4a6bc225ccf8ff0d5c1205da91d942b24e606bb225cf4da24e4664ed51 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:42,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:42,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:11:42,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:42,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:42,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:42,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:42,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:42,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:42,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:42,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:42,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:42,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:42,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:42,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:42,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:42,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:42,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:42,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:11:42,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:42,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:42,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:42,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:42,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:42,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:42,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:42,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:42,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:42,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:42,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:42,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:42,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:11:42,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:11:42,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:42,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:42,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:42,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:42,359 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 -> bbe8ef4a6bc225ccf8ff0d5c1205da91d942b24e606bb225cf4da24e4664ed51 [2024-11-08 23:11:42,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:42,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:42,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:42,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:42,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:42,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-08 23:11:43,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:44,112 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:44,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-08 23:11:44,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebad7a61/5e32451c07374ce0939d90a15133fca2/FLAG21ac597c4 [2024-11-08 23:11:44,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebad7a61/5e32451c07374ce0939d90a15133fca2 [2024-11-08 23:11:44,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:44,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:44,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:44,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:44,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:44,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa9b697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44, skipping insertion in model container [2024-11-08 23:11:44,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:44,322 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-64.i[916,929] [2024-11-08 23:11:44,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:44,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:44,403 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-64.i[916,929] [2024-11-08 23:11:44,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:44,438 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:44,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44 WrapperNode [2024-11-08 23:11:44,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:44,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:44,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:44,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:44,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,492 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-08 23:11:44,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:44,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:44,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:44,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:44,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:44,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:44,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:44,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:44,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:44,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (1/1) ... [2024-11-08 23:11:44,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:44,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:44,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:11:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:44,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:44,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:44,935 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:44,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:44,947 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:44,947 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:44,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:44 BoogieIcfgContainer [2024-11-08 23:11:44,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:44,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:44,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:44,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:44,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:44" (1/3) ... [2024-11-08 23:11:44,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c61034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:44, skipping insertion in model container [2024-11-08 23:11:44,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:44" (2/3) ... [2024-11-08 23:11:44,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c61034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:44, skipping insertion in model container [2024-11-08 23:11:44,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:44" (3/3) ... [2024-11-08 23:11:44,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-08 23:11:44,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:44,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:45,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:45,033 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;@1305d875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:45,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:11:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:11:45,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:45,048 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:45,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash 515289754, now seen corresponding path program 1 times [2024-11-08 23:11:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311357400] [2024-11-08 23:11:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:11:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:11:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:11:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:11:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:11:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:11:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:11:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:11:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:11:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:11:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:11:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:11:45,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311357400] [2024-11-08 23:11:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311357400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146200840] [2024-11-08 23:11:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:45,468 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:11:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:45,492 INFO L93 Difference]: Finished difference Result 137 states and 240 transitions. [2024-11-08 23:11:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:45,494 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-08 23:11:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:45,499 INFO L225 Difference]: With dead ends: 137 [2024-11-08 23:11:45,499 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 23:11:45,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:45,504 INFO L432 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:45,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 23:11:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 23:11:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:11:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2024-11-08 23:11:45,541 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 148 [2024-11-08 23:11:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2024-11-08 23:11:45,542 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:11:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2024-11-08 23:11:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 23:11:45,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:45,545 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:45,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:11:45,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:45,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1601875232, now seen corresponding path program 1 times [2024-11-08 23:11:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:45,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736546404] [2024-11-08 23:11:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:11:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:11:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:11:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:11:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:11:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:11:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:11:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:11:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:11:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:11:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:11:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:11:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736546404] [2024-11-08 23:11:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736546404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:48,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:48,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:11:48,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935144909] [2024-11-08 23:11:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:48,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:11:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:11:48,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:11:48,008 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:11:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:50,833 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2024-11-08 23:11:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:11:50,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2024-11-08 23:11:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:50,839 INFO L225 Difference]: With dead ends: 271 [2024-11-08 23:11:50,841 INFO L226 Difference]: Without dead ends: 206 [2024-11-08 23:11:50,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:11:50,843 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 251 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:50,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 466 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 23:11:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-08 23:11:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 79. [2024-11-08 23:11:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:11:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-08 23:11:50,860 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 148 [2024-11-08 23:11:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:50,861 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-08 23:11:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 23:11:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-08 23:11:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 23:11:50,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:50,863 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:50,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:11:50,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1610898050, now seen corresponding path program 1 times [2024-11-08 23:11:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680449808] [2024-11-08 23:11:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:11:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:11:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:11:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:11:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:11:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:11:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:11:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:11:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:11:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:11:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:11:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:11:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680449808] [2024-11-08 23:11:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680449808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:11:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729227892] [2024-11-08 23:11:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:11:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:11:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:11:51,120 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:51,131 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2024-11-08 23:11:51,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:11:51,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2024-11-08 23:11:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:51,133 INFO L225 Difference]: With dead ends: 154 [2024-11-08 23:11:51,133 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 23:11:51,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-08 23:11:51,135 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:51,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 96 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 23:11:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-11-08 23:11:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:11:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2024-11-08 23:11:51,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 149 [2024-11-08 23:11:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:51,143 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2024-11-08 23:11:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2024-11-08 23:11:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 23:11:51,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:51,145 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:11:51,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1657009403, now seen corresponding path program 1 times [2024-11-08 23:11:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331018710] [2024-11-08 23:11:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:11:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:11:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:11:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:11:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:11:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:11:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:11:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:11:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:11:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:11:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:11:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:11:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331018710] [2024-11-08 23:11:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331018710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:11:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861917929] [2024-11-08 23:11:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:11:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:11:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:11:51,510 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:51,587 INFO L93 Difference]: Finished difference Result 120 states and 176 transitions. [2024-11-08 23:11:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:11:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-08 23:11:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:51,589 INFO L225 Difference]: With dead ends: 120 [2024-11-08 23:11:51,589 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 23:11:51,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:11:51,590 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 73 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:51,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 681 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 23:11:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-08 23:11:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:11:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2024-11-08 23:11:51,616 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 150 [2024-11-08 23:11:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2024-11-08 23:11:51,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2024-11-08 23:11:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 23:11:51,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:51,621 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:11:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:11:51,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1966514537, now seen corresponding path program 1 times [2024-11-08 23:11:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685138186] [2024-11-08 23:11:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:11:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:11:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:11:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:11:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:11:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:11:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:11:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:11:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:11:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:11:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 23:11:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:11:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 23:11:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 23:11:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685138186] [2024-11-08 23:11:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685138186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:52,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:11:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663167307] [2024-11-08 23:11:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:52,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:11:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:11:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:11:52,088 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:52,635 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2024-11-08 23:11:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:11:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-08 23:11:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:52,637 INFO L225 Difference]: With dead ends: 231 [2024-11-08 23:11:52,637 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:11:52,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:11:52,640 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 53 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:52,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 454 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:11:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:11:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:11:52,644 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-08 23:11:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:11:52,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2024-11-08 23:11:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:11:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 23:11:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:11:52,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:11:52,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:11:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:11:52,654 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:11:52,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:11:53,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:11:53,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:53 BoogieIcfgContainer [2024-11-08 23:11:53,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:11:53,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:11:53,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:11:53,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:11:53,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:44" (3/4) ... [2024-11-08 23:11:53,030 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:11:53,034 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:11:53,039 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 23:11:53,040 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:11:53,041 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:11:53,041 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:11:53,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:11:53,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:11:53,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:11:53,124 INFO L158 Benchmark]: Toolchain (without parser) took 8986.69ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 109.6MB in the beginning and 71.4MB in the end (delta: 38.2MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,124 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 132.0MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:11:53,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.31ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 94.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,125 INFO L158 Benchmark]: Boogie Preprocessor took 43.71ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,125 INFO L158 Benchmark]: RCFGBuilder took 406.65ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 67.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,125 INFO L158 Benchmark]: TraceAbstraction took 8076.53ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 66.9MB in the beginning and 77.7MB in the end (delta: -10.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,125 INFO L158 Benchmark]: Witness Printer took 96.37ms. Allocated memory is still 241.2MB. Free memory was 77.7MB in the beginning and 71.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:11:53,126 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.18ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 132.0MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.31ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 94.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.71ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.65ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 67.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8076.53ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 66.9MB in the beginning and 77.7MB in the end (delta: -10.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 96.37ms. Allocated memory is still 241.2MB. Free memory was 77.7MB in the beginning and 71.4MB 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, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 1800 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1252 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 548 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 129 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 5594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5520/5520 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: 118]: Loop Invariant Derived loop invariant: ((var_1_10 <= 0) && (0 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_10 <= 0) && (0 <= 0)) Ensures: (((var_1_10 <= 0) && (0 <= 0)) && (((((((((((((((((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_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_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_16 == \old(last_1_var_1_16)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:11:53,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE