./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.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 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:59:06,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:59:06,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:59:06,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:59:06,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:59:06,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:59:06,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:59:06,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:59:06,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:59:06,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:59:06,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:59:06,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:59:06,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:59:06,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:59:06,131 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:59:06,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:59:06,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:59:06,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:59:06,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:59:06,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:59:06,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:59:06,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:59:06,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:59:06,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:59:06,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:59:06,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:59:06,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:59:06,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:59:06,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:59:06,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:59:06,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:59:06,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:59:06,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:06,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:59:06,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:59:06,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:59:06,146 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 -> 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 [2024-10-24 08:59:06,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:59:06,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:59:06,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:59:06,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:59:06,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:59:06,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2024-10-24 08:59:07,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:59:07,816 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:59:07,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2024-10-24 08:59:07,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e11d8457/581a59af742c4e8f8cb608c691669ab6/FLAG53e9deb3b [2024-10-24 08:59:07,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e11d8457/581a59af742c4e8f8cb608c691669ab6 [2024-10-24 08:59:07,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:59:07,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:59:07,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:07,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:59:07,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:59:07,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:07" (1/1) ... [2024-10-24 08:59:07,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33223e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:07, skipping insertion in model container [2024-10-24 08:59:07,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:07" (1/1) ... [2024-10-24 08:59:07,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:59:08,005 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2024-10-24 08:59:08,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:08,054 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:59:08,064 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2024-10-24 08:59:08,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:08,134 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:59:08,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08 WrapperNode [2024-10-24 08:59:08,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:08,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:08,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:59:08,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:59:08,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,192 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-24 08:59:08,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:08,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:59:08,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:59:08,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:59:08,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:59:08,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:59:08,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:59:08,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:59:08,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:59:08,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (1/1) ... [2024-10-24 08:59:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:08,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:59:08,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:59:08,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:59:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:59:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:59:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:59:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:59:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:59:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:59:08,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:59:08,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:59:08,570 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 08:59:08,570 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:59:08,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:59:08,610 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:59:08,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:08 BoogieIcfgContainer [2024-10-24 08:59:08,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:59:08,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:59:08,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:59:08,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:59:08,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:59:07" (1/3) ... [2024-10-24 08:59:08,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39844fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:08, skipping insertion in model container [2024-10-24 08:59:08,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:08" (2/3) ... [2024-10-24 08:59:08,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39844fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:08, skipping insertion in model container [2024-10-24 08:59:08,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:08" (3/3) ... [2024-10-24 08:59:08,617 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-8.i [2024-10-24 08:59:08,631 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:59:08,632 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:59:08,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:59:08,690 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;@13465e2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:59:08,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:59:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:59:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:59:08,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:08,709 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:08,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:08,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash -952863158, now seen corresponding path program 1 times [2024-10-24 08:59:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493740045] [2024-10-24 08:59:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:09,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493740045] [2024-10-24 08:59:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493740045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:59:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493813457] [2024-10-24 08:59:09,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:09,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:59:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:59:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:09,107 INFO L87 Difference]: Start difference. First operand has 45 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:09,148 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2024-10-24 08:59:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:59:09,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 108 [2024-10-24 08:59:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:09,159 INFO L225 Difference]: With dead ends: 87 [2024-10-24 08:59:09,160 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 08:59:09,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:09,165 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:09,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 08:59:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 08:59:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:59:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-24 08:59:09,236 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 108 [2024-10-24 08:59:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:09,237 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-24 08:59:09,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-24 08:59:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:59:09,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:09,245 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:59:09,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:09,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash -272189558, now seen corresponding path program 1 times [2024-10-24 08:59:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397605370] [2024-10-24 08:59:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397605370] [2024-10-24 08:59:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397605370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476636558] [2024-10-24 08:59:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:09,526 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:09,643 INFO L93 Difference]: Finished difference Result 85 states and 127 transitions. [2024-10-24 08:59:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2024-10-24 08:59:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:09,648 INFO L225 Difference]: With dead ends: 85 [2024-10-24 08:59:09,649 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 08:59:09,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:09,652 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:09,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 08:59:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 08:59:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:59:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2024-10-24 08:59:09,671 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 108 [2024-10-24 08:59:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:09,673 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2024-10-24 08:59:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2024-10-24 08:59:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:59:09,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:09,677 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:09,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:59:09,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:09,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash -270342516, now seen corresponding path program 1 times [2024-10-24 08:59:09,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:09,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891474110] [2024-10-24 08:59:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891474110] [2024-10-24 08:59:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891474110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:59:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658478224] [2024-10-24 08:59:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:59:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:59:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:59:10,936 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:11,119 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2024-10-24 08:59:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:59:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2024-10-24 08:59:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:11,121 INFO L225 Difference]: With dead ends: 69 [2024-10-24 08:59:11,122 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 08:59:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:59:11,123 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:11,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 247 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 08:59:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-10-24 08:59:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 08:59:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-10-24 08:59:11,135 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 108 [2024-10-24 08:59:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-10-24 08:59:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-10-24 08:59:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 08:59:11,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:11,137 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:11,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:59:11,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:11,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash -270282934, now seen corresponding path program 1 times [2024-10-24 08:59:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518358310] [2024-10-24 08:59:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:11,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518358310] [2024-10-24 08:59:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518358310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:13,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:13,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:59:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864638138] [2024-10-24 08:59:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:13,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:59:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:59:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:59:13,029 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:13,271 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2024-10-24 08:59:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:59:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2024-10-24 08:59:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:13,272 INFO L225 Difference]: With dead ends: 80 [2024-10-24 08:59:13,273 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:59:13,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:59:13,274 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:13,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 323 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:59:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:59:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:59:13,275 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-10-24 08:59:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:59:13,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2024-10-24 08:59:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:13,276 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:59:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:59:13,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:59:13,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:59:13,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:59:13,283 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 08:59:13,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:59:13,443 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:59:13,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:59:13 BoogieIcfgContainer [2024-10-24 08:59:13,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:59:13,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:59:13,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:59:13,464 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:59:13,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:08" (3/4) ... [2024-10-24 08:59:13,466 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:59:13,468 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:59:13,472 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 08:59:13,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 08:59:13,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:59:13,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:59:13,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:59:13,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:59:13,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:59:13,546 INFO L158 Benchmark]: Toolchain (without parser) took 5705.47ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 96.1MB in the beginning and 303.5MB in the end (delta: -207.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:13,546 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:13,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.53ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 136.1MB in the end (delta: -40.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.33ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 137.6MB in the end (delta: -1.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,547 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,547 INFO L158 Benchmark]: RCFGBuilder took 380.58ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 115.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,547 INFO L158 Benchmark]: TraceAbstraction took 4851.56ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 114.5MB in the beginning and 308.7MB in the end (delta: -194.2MB). Peak memory consumption was 177.0MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,547 INFO L158 Benchmark]: Witness Printer took 81.93ms. Allocated memory is still 343.9MB. Free memory was 308.7MB in the beginning and 303.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:59:13,550 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.14ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.53ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 136.1MB in the end (delta: -40.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.33ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 137.6MB in the end (delta: -1.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.58ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 115.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4851.56ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 114.5MB in the beginning and 308.7MB in the end (delta: -194.2MB). Peak memory consumption was 177.0MB. Max. memory is 16.1GB. * Witness Printer took 81.93ms. Allocated memory is still 343.9MB. Free memory was 308.7MB in the beginning and 303.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 295 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2448/2448 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: 104]: Loop Invariant Derived loop invariant: (var_1_19 < ((long long) var_1_8 + 1)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (var_1_19 <= var_1_8) Ensures: ((var_1_19 <= var_1_8) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:59:13,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE