./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-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-47.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 a5688f96cca39ce600e330f454e57bca5bee6291d93b987dd27f548e1ca06786 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:37:13,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:37:13,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:37:13,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:37:13,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:37:13,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:37:13,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:37:13,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:37:13,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:37:13,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:37:13,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:37:13,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:37:13,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:37:13,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:37:13,273 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:37:13,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:37:13,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:37:13,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:37:13,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:37:13,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:37:13,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:37:13,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:37:13,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:37:13,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:37:13,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:37:13,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:37:13,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:37:13,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:37:13,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:37:13,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:37:13,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:37:13,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:37:13,281 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 -> a5688f96cca39ce600e330f454e57bca5bee6291d93b987dd27f548e1ca06786 [2024-10-13 03:37:13,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:37:13,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:37:13,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:37:13,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:37:13,539 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:37:13,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i [2024-10-13 03:37:14,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:37:15,219 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:37:15,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-47.i [2024-10-13 03:37:15,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3a1e639/944f58e5ad12493192c6e3243cdbaf9b/FLAGdc0c461dd [2024-10-13 03:37:15,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3a1e639/944f58e5ad12493192c6e3243cdbaf9b [2024-10-13 03:37:15,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:37:15,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:37:15,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:37:15,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:37:15,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:37:15,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135dd7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15, skipping insertion in model container [2024-10-13 03:37:15,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:37:15,782 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-47.i[916,929] [2024-10-13 03:37:15,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:37:15,827 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:37:15,838 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-47.i[916,929] [2024-10-13 03:37:15,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:37:15,867 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:37:15,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15 WrapperNode [2024-10-13 03:37:15,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:37:15,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:37:15,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:37:15,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:37:15,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,897 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-13 03:37:15,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:37:15,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:37:15,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:37:15,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:37:15,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,920 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-13 03:37:15,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:37:15,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:37:15,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:37:15,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:37:15,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (1/1) ... [2024-10-13 03:37:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:37:15,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:37:15,964 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-13 03:37:15,969 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-13 03:37:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:37:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:37:16,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:37:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:37:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:37:16,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:37:16,070 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:37:16,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:37:16,308 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 03:37:16,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:37:16,398 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:37:16,399 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:37:16,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:16 BoogieIcfgContainer [2024-10-13 03:37:16,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:37:16,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:37:16,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:37:16,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:37:16,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:37:15" (1/3) ... [2024-10-13 03:37:16,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c772b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:37:16, skipping insertion in model container [2024-10-13 03:37:16,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:37:15" (2/3) ... [2024-10-13 03:37:16,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c772b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:37:16, skipping insertion in model container [2024-10-13 03:37:16,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:16" (3/3) ... [2024-10-13 03:37:16,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-47.i [2024-10-13 03:37:16,431 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:37:16,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:37:16,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:37:16,513 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;@3f26a79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:37:16,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:37:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 03:37:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 03:37:16,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:16,531 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:37:16,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 205245354, now seen corresponding path program 1 times [2024-10-13 03:37:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:16,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561837037] [2024-10-13 03:37:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:37:16,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561837037] [2024-10-13 03:37:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561837037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:37:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888302137] [2024-10-13 03:37:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:16,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:37:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:37:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:37:16,807 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 03:37:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:16,838 INFO L93 Difference]: Finished difference Result 70 states and 118 transitions. [2024-10-13 03:37:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:37:16,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 66 [2024-10-13 03:37:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:16,851 INFO L225 Difference]: With dead ends: 70 [2024-10-13 03:37:16,851 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 03:37:16,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-13 03:37:16,860 INFO L432 NwaCegarLoop]: 45 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, 45 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-13 03:37:16,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:37:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 03:37:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 03:37:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 03:37:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-10-13 03:37:16,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 66 [2024-10-13 03:37:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:16,898 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-13 03:37:16,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 03:37:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-10-13 03:37:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 03:37:16,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:16,901 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:37:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:37:16,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1507019096, now seen corresponding path program 1 times [2024-10-13 03:37:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316851952] [2024-10-13 03:37:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:37:54,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:54,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316851952] [2024-10-13 03:37:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316851952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:54,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:54,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:37:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927680241] [2024-10-13 03:37:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:54,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:37:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:54,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:37:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:37:54,120 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:54,357 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2024-10-13 03:37:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:37:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-10-13 03:37:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:54,359 INFO L225 Difference]: With dead ends: 47 [2024-10-13 03:37:54,360 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 03:37:54,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:37:54,361 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:54,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:37:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 03:37:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-10-13 03:37:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 03:37:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-10-13 03:37:54,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 66 [2024-10-13 03:37:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-10-13 03:37:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-10-13 03:37:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 03:37:54,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:54,377 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:37:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:37:54,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:54,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1991980763, now seen corresponding path program 1 times [2024-10-13 03:37:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115631170] [2024-10-13 03:37:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:37:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115631170] [2024-10-13 03:37:54,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115631170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:54,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:37:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501115736] [2024-10-13 03:37:54,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:54,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:37:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:37:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:37:54,507 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:54,608 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-13 03:37:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:37:54,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-10-13 03:37:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:54,611 INFO L225 Difference]: With dead ends: 120 [2024-10-13 03:37:54,611 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 03:37:54,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-13 03:37:54,614 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 45 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:54,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:37:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 03:37:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-10-13 03:37:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:37:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-10-13 03:37:54,631 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 67 [2024-10-13 03:37:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-10-13 03:37:54,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-10-13 03:37:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 03:37:54,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:54,635 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:37:54,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:37:54,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:54,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1754511740, now seen corresponding path program 1 times [2024-10-13 03:37:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916717916] [2024-10-13 03:37:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:37:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:37:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:37:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:37:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:37:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:37:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:37:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:37:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:37:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:37:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:37:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:37:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:37:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916717916] [2024-10-13 03:37:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916717916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:37:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:37:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:37:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440750259] [2024-10-13 03:37:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:37:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:37:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:37:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:37:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:37:54,733 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:37:54,771 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2024-10-13 03:37:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:37:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-10-13 03:37:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:37:54,773 INFO L225 Difference]: With dead ends: 148 [2024-10-13 03:37:54,773 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 03:37:54,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-10-13 03:37:54,774 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:37:54,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:37:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 03:37:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-10-13 03:37:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:37:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-10-13 03:37:54,787 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 67 [2024-10-13 03:37:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:37:54,787 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-10-13 03:37:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:37:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-10-13 03:37:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 03:37:54,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:37:54,789 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:37:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:37:54,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:37:54,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:37:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1754452158, now seen corresponding path program 1 times [2024-10-13 03:37:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:37:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128600446] [2024-10-13 03:37:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:37:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:37:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:38:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:38:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:38:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:38:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:38:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:38:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:38:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:38:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:38:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:38:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:38:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:38:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128600446] [2024-10-13 03:38:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128600446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:38:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:38:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:38:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902551633] [2024-10-13 03:38:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:38:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:38:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:38:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:38:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:38:22,890 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:38:22,958 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2024-10-13 03:38:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:38:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-10-13 03:38:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:38:22,960 INFO L225 Difference]: With dead ends: 126 [2024-10-13 03:38:22,960 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 03:38:22,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-13 03:38:22,962 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:38:22,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:38:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 03:38:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-13 03:38:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 72 states have internal predecessors, (87), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:38:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-10-13 03:38:22,973 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 67 [2024-10-13 03:38:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:38:22,973 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-10-13 03:38:22,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-10-13 03:38:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 03:38:22,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:22,975 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 03:38:22,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:38:22,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -765507776, now seen corresponding path program 1 times [2024-10-13 03:38:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:38:22,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571951521] [2024-10-13 03:38:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:38:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:38:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:38:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:38:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:38:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:38:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:38:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:38:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:38:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:38:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:38:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 03:38:49,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:38:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571951521] [2024-10-13 03:38:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571951521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:38:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:38:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:38:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137341510] [2024-10-13 03:38:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:38:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:38:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:38:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:38:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:38:49,195 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:38:49,286 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2024-10-13 03:38:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:38:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-10-13 03:38:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:38:49,288 INFO L225 Difference]: With dead ends: 119 [2024-10-13 03:38:49,288 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 03:38:49,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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-13 03:38:49,289 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:38:49,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 199 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:38:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 03:38:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2024-10-13 03:38:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 72 states have internal predecessors, (87), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 03:38:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-10-13 03:38:49,301 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 67 [2024-10-13 03:38:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:38:49,301 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-10-13 03:38:49,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-10-13 03:38:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 03:38:49,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:38:49,307 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:49,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:38:49,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:38:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:38:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1115906407, now seen corresponding path program 1 times [2024-10-13 03:38:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:38:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552759122] [2024-10-13 03:38:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:38:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:38:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:38:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:38:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:38:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:38:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:38:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:38:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:38:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:38:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:38:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:38:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:38:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:38:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:38:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:38:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:38:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:38:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:38:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:38:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:38:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:38:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:38:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 03:38:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:38:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552759122] [2024-10-13 03:38:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552759122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:38:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:38:49,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:38:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670429241] [2024-10-13 03:38:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:38:49,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:38:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:38:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:38:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:38:49,428 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:38:49,445 INFO L93 Difference]: Finished difference Result 184 states and 254 transitions. [2024-10-13 03:38:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:38:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 133 [2024-10-13 03:38:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:38:49,448 INFO L225 Difference]: With dead ends: 184 [2024-10-13 03:38:49,449 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 03:38:49,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-10-13 03:38:49,450 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:38:49,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:38:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 03:38:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 03:38:49,451 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-13 03:38:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 03:38:49,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-10-13 03:38:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:38:49,454 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 03:38:49,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 03:38:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 03:38:49,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 03:38:49,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:38:49,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:38:49,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:38:49,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 03:38:49,496 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:38:49,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:38:49 BoogieIcfgContainer [2024-10-13 03:38:49,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:38:49,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:38:49,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:38:49,509 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:38:49,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:37:16" (3/4) ... [2024-10-13 03:38:49,511 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 03:38:49,514 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 03:38:49,518 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 03:38:49,518 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 03:38:49,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 03:38:49,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 03:38:49,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 03:38:49,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 03:38:49,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:38:49,602 INFO L158 Benchmark]: Toolchain (without parser) took 94008.32ms. Allocated memory was 174.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 104.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 730.5MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,602 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:38:49,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.51ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 91.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.65ms. Allocated memory is still 174.1MB. Free memory was 91.1MB in the beginning and 89.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,603 INFO L158 Benchmark]: Boogie Preprocessor took 30.21ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,603 INFO L158 Benchmark]: RCFGBuilder took 473.15ms. Allocated memory is still 174.1MB. Free memory was 87.1MB in the beginning and 143.5MB in the end (delta: -56.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,603 INFO L158 Benchmark]: TraceAbstraction took 93102.98ms. Allocated memory was 174.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 142.6MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 761.6MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,603 INFO L158 Benchmark]: Witness Printer took 92.80ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:38:49,605 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.17ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.51ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 91.1MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.65ms. Allocated memory is still 174.1MB. Free memory was 91.1MB in the beginning and 89.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.21ms. Allocated memory is still 174.1MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.15ms. Allocated memory is still 174.1MB. Free memory was 87.1MB in the beginning and 143.5MB in the end (delta: -56.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 93102.98ms. Allocated memory was 174.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 142.6MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 761.6MB. Max. memory is 16.1GB. * Witness Printer took 92.80ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.0s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 849 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 339 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=5, InterpolantAutomatonStates: 34, 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, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 91.9s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 1128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1864/1864 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: 88]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 03:38:49,633 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