./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_operatoramount_amount10_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:25,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:25,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:18:25,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:25,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:26,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:26,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:26,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:26,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:26,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:26,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:26,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:26,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:26,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:26,030 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:26,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:26,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:26,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:26,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:18:26,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:26,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:26,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:26,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:26,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:26,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:26,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:26,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:26,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:26,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:26,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:26,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:26,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:26,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:26,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:26,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:26,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:26,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:18:26,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:18:26,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:26,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:26,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:26,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:26,038 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2024-10-24 10:18:26,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:26,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:26,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:26,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:26,372 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:26,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:27,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:18:27,962 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:18:27,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:27,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ff7e7d2/57bcfcffd9c647a49f3898c36ef43229/FLAG87b093713 [2024-10-24 10:18:27,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ff7e7d2/57bcfcffd9c647a49f3898c36ef43229 [2024-10-24 10:18:27,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:27,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:27,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:27,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:27,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:27,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:27" (1/1) ... [2024-10-24 10:18:27,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8b5e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:27, skipping insertion in model container [2024-10-24 10:18:27,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:27" (1/1) ... [2024-10-24 10:18:28,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:28,193 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_operatoramount_amount10_file-29.i[915,928] [2024-10-24 10:18:28,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:28,253 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:28,267 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_operatoramount_amount10_file-29.i[915,928] [2024-10-24 10:18:28,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:28,306 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:28,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28 WrapperNode [2024-10-24 10:18:28,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:28,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:28,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:28,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:28,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,360 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 10:18:28,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:28,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:28,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:28,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:28,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:18:28,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:28,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:28,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:28,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:28,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (1/1) ... [2024-10-24 10:18:28,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:28,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:28,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:18:28,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:18:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:28,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:18:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:28,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:28,594 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:28,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:28,909 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:28,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:28,957 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:28,958 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:28,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:28 BoogieIcfgContainer [2024-10-24 10:18:28,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:28,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:28,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:28,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:28,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:27" (1/3) ... [2024-10-24 10:18:28,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f4f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:28, skipping insertion in model container [2024-10-24 10:18:28,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:28" (2/3) ... [2024-10-24 10:18:28,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167f4f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:28, skipping insertion in model container [2024-10-24 10:18:28,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:28" (3/3) ... [2024-10-24 10:18:28,967 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:28,983 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:28,984 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:29,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:29,051 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;@6888efc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:29,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:18:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 10:18:29,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:29,069 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:29,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1447709040, now seen corresponding path program 1 times [2024-10-24 10:18:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383405182] [2024-10-24 10:18:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:18:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:18:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:18:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:18:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:18:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:18:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:18:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:18:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383405182] [2024-10-24 10:18:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383405182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340213045] [2024-10-24 10:18:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:29,504 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:18:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:29,545 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-24 10:18:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:29,551 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2024-10-24 10:18:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:29,559 INFO L225 Difference]: With dead ends: 83 [2024-10-24 10:18:29,559 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 10:18:29,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:29,567 INFO L432 NwaCegarLoop]: 57 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, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:29,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 10:18:29,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 10:18:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:18:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-24 10:18:29,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 96 [2024-10-24 10:18:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:29,621 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-24 10:18:29,621 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:18:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-24 10:18:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 10:18:29,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:29,627 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:29,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:18:29,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 204848784, now seen corresponding path program 1 times [2024-10-24 10:18:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791577661] [2024-10-24 10:18:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:18:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:18:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:18:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:18:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:18:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:18:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:18:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:18:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791577661] [2024-10-24 10:18:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791577661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:18:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443180105] [2024-10-24 10:18:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:30,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:18:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:18:30,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:30,746 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:31,220 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-10-24 10:18:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:18:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2024-10-24 10:18:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:31,224 INFO L225 Difference]: With dead ends: 58 [2024-10-24 10:18:31,224 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 10:18:31,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:18:31,227 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:31,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 234 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:18:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 10:18:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-24 10:18:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:18:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2024-10-24 10:18:31,256 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 96 [2024-10-24 10:18:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:31,257 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2024-10-24 10:18:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-10-24 10:18:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 10:18:31,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:31,264 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:18:31,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash -583900962, now seen corresponding path program 1 times [2024-10-24 10:18:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:31,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884254685] [2024-10-24 10:18:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:18:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:18:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:18:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:18:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:18:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:18:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:18:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:18:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884254685] [2024-10-24 10:18:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884254685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:18:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121134308] [2024-10-24 10:18:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:18:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:32,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:18:32,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:32,048 INFO L87 Difference]: Start difference. First operand 55 states and 77 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:32,483 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2024-10-24 10:18:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:18:32,484 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2024-10-24 10:18:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:32,490 INFO L225 Difference]: With dead ends: 76 [2024-10-24 10:18:32,491 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 10:18:32,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:18:32,492 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:32,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:18:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 10:18:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-10-24 10:18:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 41 states have internal predecessors, (50), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:18:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2024-10-24 10:18:32,515 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 97 [2024-10-24 10:18:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:32,516 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2024-10-24 10:18:32,517 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2024-10-24 10:18:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 10:18:32,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:32,522 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:32,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:18:32,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1728519163, now seen corresponding path program 1 times [2024-10-24 10:18:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819293844] [2024-10-24 10:18:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:18:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:18:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:18:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:18:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:18:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:18:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:18:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819293844] [2024-10-24 10:18:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819293844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:33,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:18:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953420452] [2024-10-24 10:18:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:33,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:18:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:18:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:33,171 INFO L87 Difference]: Start difference. First operand 61 states and 86 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:33,254 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2024-10-24 10:18:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:18:33,255 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2024-10-24 10:18:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:33,256 INFO L225 Difference]: With dead ends: 146 [2024-10-24 10:18:33,258 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 10:18:33,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-24 10:18:33,263 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:33,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 120 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 10:18:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-24 10:18:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 10:18:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2024-10-24 10:18:33,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 97 [2024-10-24 10:18:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:33,290 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2024-10-24 10:18:33,290 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-10-24 10:18:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 10:18:33,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:33,292 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:33,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:18:33,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:33,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash -921123092, now seen corresponding path program 1 times [2024-10-24 10:18:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102541389] [2024-10-24 10:18:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:18:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 10:18:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:18:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:18:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:18:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:18:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:18:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:18:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:18:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:18:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:18:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102541389] [2024-10-24 10:18:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102541389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:34,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:34,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:18:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957040861] [2024-10-24 10:18:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:18:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:18:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:34,440 INFO L87 Difference]: Start difference. First operand 85 states and 116 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:34,580 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2024-10-24 10:18:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:18:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-24 10:18:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:34,585 INFO L225 Difference]: With dead ends: 157 [2024-10-24 10:18:34,587 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 10:18:34,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-24 10:18:34,589 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:34,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 10:18:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2024-10-24 10:18:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:18:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-10-24 10:18:34,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 98 [2024-10-24 10:18:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:34,615 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-10-24 10:18:34,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-10-24 10:18:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 10:18:34,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:34,616 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:18:34,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2044424047, now seen corresponding path program 1 times [2024-10-24 10:18:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:34,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164589903] [2024-10-24 10:18:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:18:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678250833] [2024-10-24 10:18:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:18:34,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:34,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:18:34,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:18:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:18:34,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:18:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:18:34,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:18:34,848 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:18:34,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:34,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:18:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 10:18:35,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 10:18:35,132 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:35,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:35 BoogieIcfgContainer [2024-10-24 10:18:35,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:35,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:35,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:35,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:35,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:28" (3/4) ... [2024-10-24 10:18:35,145 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:18:35,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:35,146 INFO L158 Benchmark]: Toolchain (without parser) took 7161.16ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 145.1MB in the beginning and 182.6MB in the end (delta: -37.5MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,146 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:35,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.18ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 130.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.83ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,147 INFO L158 Benchmark]: Boogie Preprocessor took 51.85ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,147 INFO L158 Benchmark]: RCFGBuilder took 544.84ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 134.4MB in the end (delta: -9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,147 INFO L158 Benchmark]: TraceAbstraction took 6177.97ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 133.3MB in the beginning and 182.6MB in the end (delta: -49.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:35,148 INFO L158 Benchmark]: Witness Printer took 6.20ms. Allocated memory is still 255.9MB. Free memory is still 182.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:35,152 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.15ms. Allocated memory is still 104.9MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.18ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 130.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.83ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.85ms. Allocated memory is still 176.2MB. Free memory was 128.5MB in the beginning and 125.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.84ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 134.4MB in the end (delta: -9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6177.97ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 133.3MB in the beginning and 182.6MB in the end (delta: -49.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 6.20ms. Allocated memory is still 255.9MB. Free memory is still 182.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 32; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 16; [L29] unsigned char var_1_8 = 10; [L75] isInitial = 1 [L76] FCALL initially() [L77] COND TRUE 1 [L78] FCALL updateLastVariables() [L79] CALL updateVariables() [L44] var_1_2 = __VERIFIER_nondet_uchar() [L45] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L45] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L47] var_1_3 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L48] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L50] var_1_4 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L51] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L60] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L60] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L61] var_1_7 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_8=10] [L62] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_8=10] [L63] CALL assume_abort_if_not(var_1_7 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L63] RET assume_abort_if_not(var_1_7 <= 32) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L79] RET updateVariables() [L80] CALL step() [L33] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L33] COND TRUE (var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7) [L34] var_1_1 = ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L80] RET step() [L81] CALL, EXPR property() [L71] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L71-L72] return ((var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7)) ? (var_1_1 == ((unsigned char) ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_2 ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) ; [L81] RET, EXPR property() [L81] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] [L19] reach_error() VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=0, var_1_4=-509, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-258] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 319 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:18:35,175 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_operatoramount_amount10_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:37,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:37,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:18:37,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:37,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:37,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:37,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:37,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:37,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:37,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:37,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:37,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:37,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:37,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:37,665 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:37,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:37,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:37,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:37,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:37,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:37,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:37,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:37,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:37,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:18:37,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:18:37,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:37,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:18:37,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:37,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:37,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:37,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:37,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:37,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:37,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:37,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:37,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:37,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:37,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:37,673 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:18:37,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:18:37,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:37,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:37,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:37,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:37,675 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:18:37,676 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2024-10-24 10:18:38,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:38,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:38,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:38,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:38,089 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:38,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:39,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:18:39,902 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:18:39,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:39,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f2c3561/44948a8488ce4a8591cbeee284d17497/FLAG9d0f1ea20 [2024-10-24 10:18:39,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f2c3561/44948a8488ce4a8591cbeee284d17497 [2024-10-24 10:18:39,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:39,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:39,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:39,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:39,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:39,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:39" (1/1) ... [2024-10-24 10:18:39,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8e5d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:39, skipping insertion in model container [2024-10-24 10:18:39,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:39" (1/1) ... [2024-10-24 10:18:39,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:40,158 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_operatoramount_amount10_file-29.i[915,928] [2024-10-24 10:18:40,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:40,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:40,231 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_operatoramount_amount10_file-29.i[915,928] [2024-10-24 10:18:40,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:40,271 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:40,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40 WrapperNode [2024-10-24 10:18:40,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:40,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:40,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:40,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:40,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,312 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-10-24 10:18:40,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:40,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:40,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:40,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:40,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,350 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:18:40,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:40,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:40,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:40,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:40,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (1/1) ... [2024-10-24 10:18:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:40,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:18:40,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:18:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:18:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:40,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:40,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:40,512 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:40,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:40,819 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:40,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:40,874 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:40,876 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:40,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:40 BoogieIcfgContainer [2024-10-24 10:18:40,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:40,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:40,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:40,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:40,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:39" (1/3) ... [2024-10-24 10:18:40,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c05721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:40, skipping insertion in model container [2024-10-24 10:18:40,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:40" (2/3) ... [2024-10-24 10:18:40,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c05721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:40, skipping insertion in model container [2024-10-24 10:18:40,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:40" (3/3) ... [2024-10-24 10:18:40,885 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2024-10-24 10:18:40,901 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:40,901 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:40,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:40,976 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;@3e44156f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:40,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:18:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:18:40,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:40,991 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:40,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash 297327413, now seen corresponding path program 1 times [2024-10-24 10:18:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305205036] [2024-10-24 10:18:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:41,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:41,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:18:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:41,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:18:41,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-24 10:18:41,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:41,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305205036] [2024-10-24 10:18:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305205036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099991564] [2024-10-24 10:18:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:41,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:41,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:41,311 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:41,367 INFO L93 Difference]: Finished difference Result 73 states and 130 transitions. [2024-10-24 10:18:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 93 [2024-10-24 10:18:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:41,386 INFO L225 Difference]: With dead ends: 73 [2024-10-24 10:18:41,387 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 10:18:41,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:41,395 INFO L432 NwaCegarLoop]: 50 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, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:41,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 10:18:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-24 10:18:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:18:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2024-10-24 10:18:41,444 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 93 [2024-10-24 10:18:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:41,445 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2024-10-24 10:18:41,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2024-10-24 10:18:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:18:41,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:41,450 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:41,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:18:41,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:41,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:41,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash 376820533, now seen corresponding path program 1 times [2024-10-24 10:18:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653788244] [2024-10-24 10:18:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:41,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:41,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:41,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:18:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:41,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:18:41,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:43,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:43,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653788244] [2024-10-24 10:18:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653788244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:43,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:18:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810257659] [2024-10-24 10:18:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:18:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:18:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:18:43,546 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:44,612 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-10-24 10:18:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:18:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 93 [2024-10-24 10:18:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:44,621 INFO L225 Difference]: With dead ends: 49 [2024-10-24 10:18:44,621 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 10:18:44,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:44,622 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:44,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:18:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 10:18:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-24 10:18:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:18:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-24 10:18:44,637 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 93 [2024-10-24 10:18:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-24 10:18:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-24 10:18:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 10:18:44,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:44,641 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:44,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:18:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:44,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1203527834, now seen corresponding path program 1 times [2024-10-24 10:18:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041890597] [2024-10-24 10:18:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:44,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:44,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:18:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:44,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:18:44,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:18:46,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:46,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041890597] [2024-10-24 10:18:46,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041890597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:46,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:18:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973475759] [2024-10-24 10:18:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:46,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:46,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:46,232 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:47,229 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2024-10-24 10:18:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:47,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 94 [2024-10-24 10:18:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:47,235 INFO L225 Difference]: With dead ends: 54 [2024-10-24 10:18:47,235 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:18:47,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:47,237 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:47,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:18:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:18:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:18:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 10:18:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:18:47,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2024-10-24 10:18:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:47,239 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:18:47,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:18:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:18:47,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:18:47,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:47,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:18:47,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:47,446 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:18:47,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:18:47,857 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:47,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:47 BoogieIcfgContainer [2024-10-24 10:18:47,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:47,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:47,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:47,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:47,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:40" (3/4) ... [2024-10-24 10:18:47,907 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:18:47,911 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:18:47,939 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:18:47,940 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-24 10:18:47,940 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:18:47,941 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:18:48,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:18:48,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:18:48,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:48,034 INFO L158 Benchmark]: Toolchain (without parser) took 8097.90ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 37.4MB in the beginning and 72.0MB in the end (delta: -34.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:48,035 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:48,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.46ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 41.5MB in the end (delta: -4.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 39.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,036 INFO L158 Benchmark]: Boogie Preprocessor took 52.85ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,036 INFO L158 Benchmark]: RCFGBuilder took 508.32ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 38.1MB in the end (delta: -645.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,037 INFO L158 Benchmark]: TraceAbstraction took 7022.34ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 37.6MB in the beginning and 77.5MB in the end (delta: -39.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,037 INFO L158 Benchmark]: Witness Printer took 132.97ms. Allocated memory is still 100.7MB. Free memory was 77.5MB in the beginning and 72.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:18:48,038 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.46ms. Allocated memory is still 67.1MB. Free memory was 37.2MB in the beginning and 41.5MB in the end (delta: -4.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 39.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.85ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.32ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 38.1MB in the end (delta: -645.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7022.34ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 37.6MB in the beginning and 77.5MB in the end (delta: -39.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 132.97ms. Allocated memory is still 100.7MB. Free memory was 77.5MB in the beginning and 72.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 164 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 14 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 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: 77]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:18:48,075 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