./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_operatoramount_amount25_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:28:57,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:28:57,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:28:57,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:28:57,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:28:57,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:28:57,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:28:57,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:28:57,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:28:57,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:28:57,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:28:57,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:28:57,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:28:57,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:28:57,434 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:28:57,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:28:57,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:28:57,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:28:57,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:28:57,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:28:57,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:28:57,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:28:57,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:28:57,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:28:57,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:28:57,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:28:57,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:28:57,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:28:57,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:28:57,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:28:57,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:28:57,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:28:57,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:28:57,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:28:57,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:28:57,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:28:57,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:28:57,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:28:57,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:28:57,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:28:57,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:28:57,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:28:57,445 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 -> 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 [2024-11-12 06:28:57,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:28:57,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:28:57,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:28:57,807 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:28:57,807 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:28:57,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2024-11-12 06:28:59,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:28:59,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:28:59,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2024-11-12 06:28:59,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df6ff66/b20523c6511e48e8bb53ab833c603cf0/FLAG950473311 [2024-11-12 06:28:59,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22df6ff66/b20523c6511e48e8bb53ab833c603cf0 [2024-11-12 06:28:59,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:28:59,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:28:59,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:28:59,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:28:59,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:28:59,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:28:59" (1/1) ... [2024-11-12 06:28:59,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f016f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:28:59, skipping insertion in model container [2024-11-12 06:28:59,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:28:59" (1/1) ... [2024-11-12 06:28:59,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:28:59,988 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_operatoramount_amount25_file-47.i[915,928] [2024-11-12 06:29:00,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:29:00,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:29:00,055 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_operatoramount_amount25_file-47.i[915,928] [2024-11-12 06:29:00,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:29:00,098 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:29:00,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00 WrapperNode [2024-11-12 06:29:00,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:29:00,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:29:00,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:29:00,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:29:00,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,162 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-12 06:29:00,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:29:00,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:29:00,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:29:00,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:29:00,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,226 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-12 06:29:00,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:29:00,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:29:00,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:29:00,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:29:00,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (1/1) ... [2024-11-12 06:29:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:29:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:29:00,327 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-12 06:29:00,338 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-12 06:29:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:29:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:29:00,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:29:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:29:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:29:00,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:29:00,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:29:00,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:29:00,826 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:29:00,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:29:00,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:29:00,846 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:29:00,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:29:00 BoogieIcfgContainer [2024-11-12 06:29:00,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:29:00,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:29:00,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:29:00,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:29:00,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:28:59" (1/3) ... [2024-11-12 06:29:00,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41890b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:29:00, skipping insertion in model container [2024-11-12 06:29:00,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:00" (2/3) ... [2024-11-12 06:29:00,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41890b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:29:00, skipping insertion in model container [2024-11-12 06:29:00,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:29:00" (3/3) ... [2024-11-12 06:29:00,858 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-47.i [2024-11-12 06:29:00,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:29:00,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:29:00,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:29:00,951 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;@77d3181b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:29:00,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:29:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:29:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:29:00,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:29:00,968 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:29:00,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:29:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:29:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1342335269, now seen corresponding path program 1 times [2024-11-12 06:29:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:29:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226930355] [2024-11-12 06:29:00,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:29:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:29:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:29:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:29:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:29:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:29:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:29:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:29:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:29:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:29:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:29:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:29:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:29:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:29:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226930355] [2024-11-12 06:29:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226930355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:29:01,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:29:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:29:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232600573] [2024-11-12 06:29:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:29:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:29:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:29:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:29:01,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:29:01,364 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:29:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:29:01,392 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2024-11-12 06:29:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:29:01,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-12 06:29:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:29:01,404 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:29:01,405 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 06:29:01,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:29:01,414 INFO L435 NwaCegarLoop]: 51 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, 51 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-12 06:29:01,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:29:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 06:29:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 06:29:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:29:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-12 06:29:01,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 69 [2024-11-12 06:29:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:29:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-12 06:29:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:29:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-12 06:29:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:29:01,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:29:01,475 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:29:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:29:01,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:29:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:29:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 645508055, now seen corresponding path program 1 times [2024-11-12 06:29:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:29:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212834025] [2024-11-12 06:29:01,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:29:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:29:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:29:01,765 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:29:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:29:01,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:29:01,903 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:29:01,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:29:01,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:29:01,911 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:29:01,993 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:29:02,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:29:01 BoogieIcfgContainer [2024-11-12 06:29:02,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:29:02,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:29:02,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:29:02,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:29:02,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:29:00" (3/4) ... [2024-11-12 06:29:02,008 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:29:02,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:29:02,011 INFO L158 Benchmark]: Toolchain (without parser) took 2250.53ms. Allocated memory is still 174.1MB. Free memory was 135.0MB in the beginning and 78.8MB in the end (delta: 56.3MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,012 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:29:02,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.72ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 120.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.28ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 118.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,014 INFO L158 Benchmark]: Boogie Preprocessor took 92.63ms. Allocated memory is still 174.1MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,014 INFO L158 Benchmark]: RCFGBuilder took 585.59ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 137.5MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,015 INFO L158 Benchmark]: TraceAbstraction took 1152.94ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 78.8MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-12 06:29:02,017 INFO L158 Benchmark]: Witness Printer took 6.98ms. Allocated memory is still 174.1MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:29:02,019 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.19ms. Allocated memory is still 104.9MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.72ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 120.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.28ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 118.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.63ms. Allocated memory is still 174.1MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.59ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 137.5MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1152.94ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 78.8MB in the end (delta: 57.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 6.98ms. Allocated memory is still 174.1MB. Free memory is still 78.8MB. 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 81, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryFLOAToperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 128.5; [L24] float var_1_9 = -0.5; [L25] float var_1_10 = 200.4; [L26] unsigned long int var_1_11 = 4; [L27] unsigned char var_1_12 = 1; [L28] unsigned long int var_1_13 = 3607105345; [L29] signed char var_1_14 = 0; [L30] signed char var_1_15 = 0; [L31] signed char var_1_16 = 16; [L32] double last_1_var_1_1 = 24.575; [L33] float last_1_var_1_9 = -0.5; VAL [isInitial=0, last_1_var_1_1=983/40, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_8=257/2] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_1 = var_1_1 [L78] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_8=257/2, var_1_9=4294967301] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L59] var_1_8 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L60] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L62] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L63] var_1_12 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L64] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L65] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L65] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L66] var_1_13 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L67] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L68] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L68] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L69] var_1_15 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L70] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L71] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L71] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=4294967301] [L72] var_1_16 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L74] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L74] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=0, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L89] RET updateVariables() [L90] CALL step() [L37] COND FALSE !(((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) [L42] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L44] COND FALSE !(\read(var_1_12)) [L47] var_1_11 = ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967301] [L49] var_1_9 = ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=983/40, var_1_9=4294967299] [L50] COND FALSE !(var_1_9 <= var_1_9) [L55] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_9 <= var_1_9) ? (((var_1_11 + var_1_11) >= (var_1_14 + var_1_14)) ? (var_1_1 == ((double) var_1_8)) : 1) : (var_1_1 == ((double) var_1_8))) && (var_1_9 == ((float) ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f))))))))) && (var_1_12 ? (var_1_11 == ((unsigned long int) ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))))) : (var_1_11 == ((unsigned long int) ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))))))) && ((((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) ? (var_1_12 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : 1) : (var_1_14 == ((signed char) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=4294967301, var_1_11=4294967136, var_1_12=0, var_1_13=4294967294, var_1_14=126, var_1_15=126, var_1_16=1, var_1_1=4294967300, var_1_8=4294967300, var_1_9=4294967299] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 51 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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-12 06:29:02,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount25_file-47.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 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:29:04,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:29:04,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:29:04,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:29:04,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:29:04,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:29:04,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:29:04,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:29:04,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:29:04,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:29:04,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:29:04,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:29:04,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:29:04,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:29:04,698 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:29:04,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:29:04,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:29:04,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:29:04,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:29:04,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:29:04,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:29:04,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:29:04,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:29:04,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:29:04,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:29:04,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:29:04,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:29:04,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:29:04,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:29:04,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:29:04,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:29:04,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:29:04,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:29:04,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:29:04,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:29:04,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:29:04,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:29:04,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:29:04,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:29:04,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:29:04,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:29:04,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:29:04,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:29:04,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:29:04,712 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 -> 84580c439ea85a9e7d0de81baf3e48a12bc732c424c1741d74078f19769c6d85 [2024-11-12 06:29:05,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:29:05,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:29:05,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:29:05,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:29:05,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:29:05,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2024-11-12 06:29:06,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:29:07,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:29:07,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-47.i [2024-11-12 06:29:07,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff06270/f4aec777110740a8bbf381bcf09f6291/FLAG119dc7fd3 [2024-11-12 06:29:07,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff06270/f4aec777110740a8bbf381bcf09f6291 [2024-11-12 06:29:07,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:29:07,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:29:07,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:29:07,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:29:07,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:29:07,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:07,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd6404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07, skipping insertion in model container [2024-11-12 06:29:07,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:07,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:29:07,743 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_operatoramount_amount25_file-47.i[915,928] [2024-11-12 06:29:07,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:29:07,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:29:07,843 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_operatoramount_amount25_file-47.i[915,928] [2024-11-12 06:29:07,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:29:07,929 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:29:07,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07 WrapperNode [2024-11-12 06:29:07,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:29:07,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:29:07,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:29:07,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:29:07,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:07,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:07,992 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-12 06:29:07,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:29:07,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:29:07,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:29:07,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:29:08,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,024 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-12 06:29:08,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:29:08,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:29:08,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:29:08,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:29:08,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (1/1) ... [2024-11-12 06:29:08,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:29:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:29:08,110 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-12 06:29:08,119 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-12 06:29:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:29:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:29:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:29:08,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:29:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:29:08,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:29:08,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:29:08,267 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:29:08,773 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:29:08,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:29:08,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:29:08,792 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:29:08,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:29:08 BoogieIcfgContainer [2024-11-12 06:29:08,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:29:08,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:29:08,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:29:08,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:29:08,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:29:07" (1/3) ... [2024-11-12 06:29:08,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c4ffa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:29:08, skipping insertion in model container [2024-11-12 06:29:08,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:29:07" (2/3) ... [2024-11-12 06:29:08,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c4ffa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:29:08, skipping insertion in model container [2024-11-12 06:29:08,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:29:08" (3/3) ... [2024-11-12 06:29:08,802 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-47.i [2024-11-12 06:29:08,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:29:08,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:29:08,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:29:08,916 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;@8e89563, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:29:08,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:29:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:29:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:29:08,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:29:08,935 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:29:08,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:29:08,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:29:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1342335269, now seen corresponding path program 1 times [2024-11-12 06:29:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:29:08,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096590818] [2024-11-12 06:29:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:29:08,959 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-12 06:29:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:29:08,961 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-12 06:29:08,962 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-12 06:29:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:29:09,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:29:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-12 06:29:09,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:29:09,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:29:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096590818] [2024-11-12 06:29:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096590818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:29:09,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:29:09,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:29:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724727476] [2024-11-12 06:29:09,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:29:09,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:29:09,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:29:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:29:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:29:09,305 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:29:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:29:09,335 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2024-11-12 06:29:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:29:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-12 06:29:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:29:09,347 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:29:09,348 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 06:29:09,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 06:29:09,355 INFO L435 NwaCegarLoop]: 51 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, 51 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-12 06:29:09,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:29:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 06:29:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 06:29:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:29:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-12 06:29:09,392 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 69 [2024-11-12 06:29:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:29:09,392 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-12 06:29:09,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:29:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-12 06:29:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:29:09,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:29:09,396 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:29:09,405 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-12 06:29:09,596 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-12 06:29:09,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:29:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:29:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 645508055, now seen corresponding path program 1 times [2024-11-12 06:29:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:29:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220137051] [2024-11-12 06:29:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:29:09,599 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-12 06:29:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:29:09,601 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-12 06:29:09,602 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-12 06:29:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:29:09,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:29:09,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:29:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-12 06:29:14,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:29:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-12 06:29:25,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:29:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220137051] [2024-11-12 06:29:25,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220137051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:29:25,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:29:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-12 06:29:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460759228] [2024-11-12 06:29:25,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:29:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:29:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:29:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:29:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:29:25,028 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 06:29:39,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:29:51,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:29:59,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:01,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:02,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:04,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:08,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 06:30:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:30:10,463 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2024-11-12 06:30:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 06:30:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 69 [2024-11-12 06:30:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:30:10,481 INFO L225 Difference]: With dead ends: 109 [2024-11-12 06:30:10,481 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 06:30:10,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-12 06:30:10,484 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 147 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:30:10,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 133 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2024-11-12 06:30:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 06:30:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2024-11-12 06:30:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:30:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-12 06:30:10,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 69 [2024-11-12 06:30:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:30:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-12 06:30:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 06:30:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-12 06:30:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 06:30:10,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:30:10,507 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:30:10,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:30:10,708 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-12 06:30:10,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:30:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:30:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1699647086, now seen corresponding path program 1 times [2024-11-12 06:30:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:30:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919657216] [2024-11-12 06:30:10,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:30:10,711 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-12 06:30:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:30:10,713 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-12 06:30:10,716 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-12 06:30:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:30:10,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 06:30:10,885 INFO L279 TraceCheckSpWp]: Computing forward predicates...