./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.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 3ea023f6cbb338179738454eaa70c32d24154ea41da675a4be6f8e2c1cb35ad0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:06:08,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:06:08,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:06:08,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:06:08,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:06:08,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:06:08,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:06:08,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:06:08,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:06:08,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:06:08,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:06:08,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:06:08,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:06:08,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:06:08,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:06:08,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:06:08,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:06:08,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:06:08,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:06:08,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:06:08,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:06:08,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:06:08,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:06:08,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:06:08,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:06:08,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:06:08,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:06:08,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:06:08,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:06:08,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:06:08,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:06:08,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:06:08,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:06:08,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:06:08,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:06:08,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:06:08,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:06:08,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:06:08,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:06:08,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:06:08,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:06:08,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:06:08,837 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 -> 3ea023f6cbb338179738454eaa70c32d24154ea41da675a4be6f8e2c1cb35ad0 [2024-11-10 03:06:09,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:06:09,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:06:09,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:06:09,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:06:09,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:06:09,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:10,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:06:10,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:06:10,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:10,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b5bd0635/8e0098bb53fc4b12882a94eb53e4ea68/FLAG0d6fd566a [2024-11-10 03:06:10,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b5bd0635/8e0098bb53fc4b12882a94eb53e4ea68 [2024-11-10 03:06:10,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:06:10,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:06:10,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:06:10,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:06:10,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:06:10,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:10" (1/1) ... [2024-11-10 03:06:10,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c60f8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:10, skipping insertion in model container [2024-11-10 03:06:10,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:10" (1/1) ... [2024-11-10 03:06:10,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:06:11,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i[918,931] [2024-11-10 03:06:11,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:06:11,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:06:11,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i[918,931] [2024-11-10 03:06:11,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:06:11,188 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:06:11,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11 WrapperNode [2024-11-10 03:06:11,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:06:11,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:06:11,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:06:11,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:06:11,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,242 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 03:06:11,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:06:11,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:06:11,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:06:11,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:06:11,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,275 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:06:11,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:06:11,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:06:11,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:06:11,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:06:11,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (1/1) ... [2024-11-10 03:06:11,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:06:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:06:11,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:06:11,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:06:11,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:06:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:06:11,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:06:11,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:06:11,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:06:11,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:06:11,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:06:11,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:06:11,803 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:06:11,803 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:06:11,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:06:11,819 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:06:11,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:11 BoogieIcfgContainer [2024-11-10 03:06:11,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:06:11,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:06:11,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:06:11,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:06:11,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:06:10" (1/3) ... [2024-11-10 03:06:11,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d8de97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:11, skipping insertion in model container [2024-11-10 03:06:11,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:11" (2/3) ... [2024-11-10 03:06:11,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d8de97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:11, skipping insertion in model container [2024-11-10 03:06:11,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:11" (3/3) ... [2024-11-10 03:06:11,831 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:11,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:06:11,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:06:11,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:06:11,927 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;@3680af25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:06:11,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:06:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 03:06:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 03:06:11,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:11,945 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:11,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1275211824, now seen corresponding path program 1 times [2024-11-10 03:06:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:06:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977697426] [2024-11-10 03:06:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:06:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:06:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:06:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:06:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 03:06:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:06:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:06:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:06:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 03:06:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:06:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 03:06:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:06:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:06:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:06:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 03:06:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:06:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977697426] [2024-11-10 03:06:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977697426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:06:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:06:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:06:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757395567] [2024-11-10 03:06:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:06:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:06:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:06:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:06:12,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:06:12,315 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 03:06:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:06:12,336 INFO L93 Difference]: Finished difference Result 102 states and 166 transitions. [2024-11-10 03:06:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:06:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-10 03:06:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:06:12,344 INFO L225 Difference]: With dead ends: 102 [2024-11-10 03:06:12,345 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 03:06:12,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:06:12,351 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:06:12,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:06:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 03:06:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 03:06:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 03:06:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-11-10 03:06:12,388 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 92 [2024-11-10 03:06:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:06:12,389 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-11-10 03:06:12,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 03:06:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-11-10 03:06:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 03:06:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:12,393 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:12,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:06:12,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:12,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1897343783, now seen corresponding path program 1 times [2024-11-10 03:06:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:06:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443633915] [2024-11-10 03:06:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:06:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:06:12,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734633341] [2024-11-10 03:06:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:12,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:06:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:06:12,643 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-11-10 03:06:12,645 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-11-10 03:06:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:12,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 03:06:12,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:06:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-10 03:06:13,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:06:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 03:06:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:06:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443633915] [2024-11-10 03:06:13,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:06:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734633341] [2024-11-10 03:06:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734633341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:06:13,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:06:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-10 03:06:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910787256] [2024-11-10 03:06:13,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:06:13,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:06:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:06:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:06:13,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:06:13,756 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 03:06:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:06:14,178 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2024-11-10 03:06:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:06:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 93 [2024-11-10 03:06:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:06:14,181 INFO L225 Difference]: With dead ends: 126 [2024-11-10 03:06:14,181 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 03:06:14,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-10 03:06:14,184 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 116 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:06:14,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 183 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:06:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 03:06:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-10 03:06:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:06:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-10 03:06:14,213 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 93 [2024-11-10 03:06:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:06:14,215 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-10 03:06:14,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 03:06:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-10 03:06:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 03:06:14,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:14,217 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:14,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:06:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:06:14,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:14,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 558269970, now seen corresponding path program 1 times [2024-11-10 03:06:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:06:14,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754067020] [2024-11-10 03:06:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:06:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:06:14,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162923130] [2024-11-10 03:06:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:06:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:06:14,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:06:14,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:06:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:06:14,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:06:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:06:14,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:06:14,828 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:06:14,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:06:14,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:06:15,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 03:06:15,035 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:06:15,118 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:06:15,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:06:15 BoogieIcfgContainer [2024-11-10 03:06:15,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:06:15,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:06:15,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:06:15,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:06:15,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:11" (3/4) ... [2024-11-10 03:06:15,127 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:06:15,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:06:15,129 INFO L158 Benchmark]: Toolchain (without parser) took 4246.56ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 128.3MB in the beginning and 101.3MB in the end (delta: 27.0MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,129 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:06:15,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.54ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 113.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.09ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 110.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,131 INFO L158 Benchmark]: Boogie Preprocessor took 51.71ms. Allocated memory is still 184.5MB. Free memory was 110.7MB in the beginning and 107.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,132 INFO L158 Benchmark]: IcfgBuilder took 523.79ms. Allocated memory is still 184.5MB. Free memory was 107.8MB in the beginning and 91.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,133 INFO L158 Benchmark]: TraceAbstraction took 3300.06ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 90.6MB in the beginning and 101.3MB in the end (delta: -10.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-10 03:06:15,133 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 249.6MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:06:15,134 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.36ms. Allocated memory is still 184.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.54ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 113.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.09ms. Allocated memory is still 184.5MB. Free memory was 113.1MB in the beginning and 110.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.71ms. Allocated memory is still 184.5MB. Free memory was 110.7MB in the beginning and 107.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 523.79ms. Allocated memory is still 184.5MB. Free memory was 107.8MB in the beginning and 91.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3300.06ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 90.6MB in the beginning and 101.3MB in the end (delta: -10.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 249.6MB. Free memory is still 101.3MB. 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 someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L113] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L123] RET updateLastVariables() [L124] CALL updateVariables() [L89] var_1_4 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L90] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L91] var_1_5 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L92] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000, var_1_8=129/2] [L93] var_1_8 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L94] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L95] var_1_11 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L96] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L97] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L97] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L98] var_1_12 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L99] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L100] var_1_13 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L101] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L102] var_1_15 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L103] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L104] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L104] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L105] var_1_16 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L106] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L107] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L107] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L108] var_1_18 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L110] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L110] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L124] RET updateVariables() [L125] CALL step() [L43] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L46] COND FALSE !((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) [L49] var_1_10 = 4.2f VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_6=10000] [L51] var_1_20 = var_1_16 [L52] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L53] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L54] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L55] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=10000] [L62] COND FALSE !(\read(var_1_17)) [L73] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1] [L75] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_6=1] [L76] COND FALSE !(var_1_6 > var_1_6) [L79] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L84] COND TRUE var_1_1 < var_1_11 [L85] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L125] RET step() [L126] CALL, EXPR property() [L116-L117] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=21/5, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=3, var_1_20=1, var_1_21=1, var_1_5=3, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 138 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 596 SizeOfPredicates, 3 NumberOfNonLiveVariables, 229 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 918/936 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-11-10 03:06:15,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.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 3ea023f6cbb338179738454eaa70c32d24154ea41da675a4be6f8e2c1cb35ad0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:06:17,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:06:17,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:06:17,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:06:17,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:06:17,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:06:17,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:06:17,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:06:17,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:06:17,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:06:17,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:06:17,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:06:17,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:06:17,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:06:17,590 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:06:17,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:06:17,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:06:17,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:06:17,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:06:17,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:06:17,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:06:17,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:06:17,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:06:17,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:06:17,593 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:06:17,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:06:17,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:06:17,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:06:17,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:06:17,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:06:17,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:06:17,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:06:17,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:06:17,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:06:17,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:06:17,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:06:17,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:06:17,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:06:17,598 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:06:17,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:06:17,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:06:17,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:06:17,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:06:17,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:06:17,600 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 -> 3ea023f6cbb338179738454eaa70c32d24154ea41da675a4be6f8e2c1cb35ad0 [2024-11-10 03:06:17,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:06:17,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:06:17,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:06:17,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:06:17,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:06:17,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:19,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:06:19,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:06:19,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:19,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d6680cb/cb350124fe164cfabcf9a2b3e2937824/FLAGabb2f18e6 [2024-11-10 03:06:20,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d6680cb/cb350124fe164cfabcf9a2b3e2937824 [2024-11-10 03:06:20,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:06:20,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:06:20,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:06:20,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:06:20,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:06:20,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a9e1bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20, skipping insertion in model container [2024-11-10 03:06:20,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:06:20,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i[918,931] [2024-11-10 03:06:20,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:06:20,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:06:20,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-2.i[918,931] [2024-11-10 03:06:20,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:06:20,409 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:06:20,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20 WrapperNode [2024-11-10 03:06:20,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:06:20,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:06:20,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:06:20,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:06:20,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,474 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-10 03:06:20,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:06:20,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:06:20,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:06:20,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:06:20,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,525 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:06:20,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:06:20,557 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:06:20,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:06:20,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:06:20,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (1/1) ... [2024-11-10 03:06:20,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:06:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:06:20,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:06:20,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:06:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:06:20,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:06:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:06:20,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:06:20,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:06:20,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:06:20,730 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:06:20,733 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:06:33,602 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:06:33,603 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:06:33,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:06:33,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:06:33,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:33 BoogieIcfgContainer [2024-11-10 03:06:33,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:06:33,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:06:33,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:06:33,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:06:33,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:06:20" (1/3) ... [2024-11-10 03:06:33,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2839bbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:33, skipping insertion in model container [2024-11-10 03:06:33,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:20" (2/3) ... [2024-11-10 03:06:33,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2839bbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:33, skipping insertion in model container [2024-11-10 03:06:33,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:33" (3/3) ... [2024-11-10 03:06:33,633 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-2.i [2024-11-10 03:06:33,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:06:33,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:06:33,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:06:33,727 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;@52407aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:06:33,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:06:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 03:06:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 03:06:33,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:33,744 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:33,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:33,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1275211824, now seen corresponding path program 1 times [2024-11-10 03:06:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:06:33,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875436291] [2024-11-10 03:06:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:33,769 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-11-10 03:06:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:06:33,773 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-11-10 03:06:33,774 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-11-10 03:06:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:34,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:06:34,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:06:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 03:06:34,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:06:34,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:06:34,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875436291] [2024-11-10 03:06:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875436291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:06:34,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:06:34,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:06:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802173635] [2024-11-10 03:06:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:06:34,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:06:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:06:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:06:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:06:34,452 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 03:06:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:06:34,474 INFO L93 Difference]: Finished difference Result 102 states and 166 transitions. [2024-11-10 03:06:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:06:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-10 03:06:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:06:34,484 INFO L225 Difference]: With dead ends: 102 [2024-11-10 03:06:34,485 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 03:06:34,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:06:34,491 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:06:34,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:06:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 03:06:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 03:06:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 03:06:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-11-10 03:06:34,538 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 92 [2024-11-10 03:06:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:06:34,538 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-11-10 03:06:34,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 03:06:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-11-10 03:06:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 03:06:34,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:34,545 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:34,563 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 (2)] Ended with exit code 0 [2024-11-10 03:06:34,747 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-11-10 03:06:34,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1897343783, now seen corresponding path program 1 times [2024-11-10 03:06:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:06:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147127864] [2024-11-10 03:06:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:34,750 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-11-10 03:06:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:06:34,752 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-11-10 03:06:34,753 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-11-10 03:06:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:35,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:06:35,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:06:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-10 03:06:36,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:06:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-10 03:06:37,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:06:37,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147127864] [2024-11-10 03:06:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147127864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:06:37,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:06:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 03:06:37,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496699958] [2024-11-10 03:06:37,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:06:37,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:06:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:06:37,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:06:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:06:37,548 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 03:06:44,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:06:48,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:06:52,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:06:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:06:53,100 INFO L93 Difference]: Finished difference Result 128 states and 175 transitions. [2024-11-10 03:06:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:06:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 93 [2024-11-10 03:06:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:06:53,103 INFO L225 Difference]: With dead ends: 128 [2024-11-10 03:06:53,104 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 03:06:53,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:06:53,107 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 64 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:06:53,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 190 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2024-11-10 03:06:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 03:06:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-10 03:06:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 03:06:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-10 03:06:53,124 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 93 [2024-11-10 03:06:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:06:53,124 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-10 03:06:53,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 03:06:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-10 03:06:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 03:06:53,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:06:53,130 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:06:53,156 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 (3)] Ended with exit code 0 [2024-11-10 03:06:53,330 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-11-10 03:06:53,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:06:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:06:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 558269970, now seen corresponding path program 1 times [2024-11-10 03:06:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:06:53,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821939232] [2024-11-10 03:06:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:06:53,333 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-11-10 03:06:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:06:53,336 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-11-10 03:06:53,339 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-11-10 03:06:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:06:54,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 03:06:54,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:07:14,864 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:07:30,352 WARN L286 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:07:40,489 WARN L286 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)