./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0aa738c81893cf9e45d2ce8fedb94e44410f7bdb3842bfdfce6f2126b53b412a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:39:13,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:39:13,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:39:13,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:39:13,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:39:13,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:39:13,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:39:13,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:39:13,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:39:13,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:39:13,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:39:13,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:39:13,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:39:13,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:39:13,859 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:39:13,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:39:13,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:39:13,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:39:13,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:39:13,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:39:13,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:39:13,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:39:13,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:39:13,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:39:13,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:39:13,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:39:13,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:39:13,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:39:13,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:39:13,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:39:13,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:39:13,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:39:13,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:13,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:39:13,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:39:13,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:39:13,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:39:13,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:39:13,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:39:13,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:39:13,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:39:13,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:39:13,869 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-clean/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-clean/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 -> 0aa738c81893cf9e45d2ce8fedb94e44410f7bdb3842bfdfce6f2126b53b412a [2024-10-11 12:39:14,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:39:14,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:39:14,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:39:14,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:39:14,164 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:39:14,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:15,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:39:15,807 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:39:15,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:15,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47d13ec1d/c5a31b500e68423b8a866408dd6f78c3/FLAG7c3e930f1 [2024-10-11 12:39:16,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47d13ec1d/c5a31b500e68423b8a866408dd6f78c3 [2024-10-11 12:39:16,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:39:16,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:39:16,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:16,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:39:16,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:39:16,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6414ae4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16, skipping insertion in model container [2024-10-11 12:39:16,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:39:16,390 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i[915,928] [2024-10-11 12:39:16,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:16,462 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:39:16,474 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i[915,928] [2024-10-11 12:39:16,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:16,521 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:39:16,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16 WrapperNode [2024-10-11 12:39:16,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:16,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:16,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:39:16,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:39:16,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,560 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 12:39:16,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:16,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:39:16,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:39:16,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:39:16,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,590 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:39:16,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:39:16,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:39:16,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:39:16,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:39:16,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (1/1) ... [2024-10-11 12:39:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:16,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:39:16,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:39:16,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:39:16,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:39:16,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:39:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:39:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:39:16,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:39:16,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:39:16,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:39:16,976 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:39:16,976 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:39:17,026 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:39:17,026 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:39:17,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:17 BoogieIcfgContainer [2024-10-11 12:39:17,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:39:17,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:39:17,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:39:17,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:39:17,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:16" (1/3) ... [2024-10-11 12:39:17,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:17, skipping insertion in model container [2024-10-11 12:39:17,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:16" (2/3) ... [2024-10-11 12:39:17,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:17, skipping insertion in model container [2024-10-11 12:39:17,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:17" (3/3) ... [2024-10-11 12:39:17,038 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:17,050 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:39:17,051 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:39:17,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:39:17,111 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;@11bf68af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:39:17,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:39:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:39:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 12:39:17,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:17,130 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:17,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -842173767, now seen corresponding path program 1 times [2024-10-11 12:39:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:39:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313461098] [2024-10-11 12:39:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:39:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:39:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:39:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:39:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:39:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 12:39:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:39:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 12:39:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:39:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 12:39:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:39:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 12:39:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:39:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 12:39:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 12:39:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 12:39:17,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:39:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313461098] [2024-10-11 12:39:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313461098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:39:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941404343] [2024-10-11 12:39:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:17,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:39:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:39:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:39:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:17,583 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 12:39:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:17,633 INFO L93 Difference]: Finished difference Result 85 states and 144 transitions. [2024-10-11 12:39:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:39:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-10-11 12:39:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:17,648 INFO L225 Difference]: With dead ends: 85 [2024-10-11 12:39:17,648 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 12:39:17,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:17,660 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:17,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:39:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 12:39:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 12:39:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:39:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-11 12:39:17,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 90 [2024-10-11 12:39:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-11 12:39:17,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 12:39:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-11 12:39:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 12:39:17,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:17,716 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:39:17,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1333153197, now seen corresponding path program 1 times [2024-10-11 12:39:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:39:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211231723] [2024-10-11 12:39:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:39:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:39:17,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:39:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:39:18,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:39:18,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:39:18,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:39:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:39:18,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:39:18,129 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:39:18,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:39:18 BoogieIcfgContainer [2024-10-11 12:39:18,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:39:18,134 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:39:18,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:39:18,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:39:18,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:17" (3/4) ... [2024-10-11 12:39:18,137 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:39:18,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:39:18,138 INFO L158 Benchmark]: Toolchain (without parser) took 1974.19ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 52.5MB in the end (delta: 66.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,140 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 78.2MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.50ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 104.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.45ms. Allocated memory is still 151.0MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,144 INFO L158 Benchmark]: Boogie Preprocessor took 42.22ms. Allocated memory is still 151.0MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,144 INFO L158 Benchmark]: RCFGBuilder took 421.91ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 114.5MB in the end (delta: -13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,145 INFO L158 Benchmark]: TraceAbstraction took 1104.83ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 53.1MB in the end (delta: 60.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 12:39:18,145 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 151.0MB. Free memory was 53.1MB in the beginning and 52.5MB in the end (delta: 571.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:39:18,148 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.09ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 78.2MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.50ms. Allocated memory is still 151.0MB. Free memory was 118.7MB in the beginning and 104.8MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.45ms. Allocated memory is still 151.0MB. Free memory was 104.8MB in the beginning and 102.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.22ms. Allocated memory is still 151.0MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.91ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 114.5MB in the end (delta: -13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1104.83ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 53.1MB in the end (delta: 60.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 151.0MB. Free memory was 53.1MB in the beginning and 52.5MB in the end (delta: 571.4kB). 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 someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = -16; [L32] float var_1_11 = 127.075; [L33] float var_1_12 = 1.2; [L34] signed short int var_1_16 = 4; [L35] signed short int var_1_18 = -64; [L36] signed char var_1_19 = -32; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L69] var_1_4 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L70] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L71] var_1_5 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L72] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=128, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L87] var_1_12 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L101] RET updateVariables() [L102] CALL step() [L40] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L41] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L49] var_1_19 = -2 VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L50] COND TRUE \read(var_1_9) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L51] COND TRUE 255.5f != (var_1_11 - var_1_12) [L52] var_1_10 = ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))) VAL [isInitial=1, var_1_10=-2, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L59] COND TRUE \read(var_1_9) [L60] var_1_16 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-64, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L62] var_1_18 = var_1_19 [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : (var_1_9 ? (var_1_1 == ((unsigned long int) var_1_7)) : (var_1_1 == ((unsigned long int) var_1_6)))) && (var_1_9 ? ((255.5f != (var_1_11 - var_1_12)) ? (var_1_10 == ((signed short int) ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))))) : 1) : ((var_1_4 <= var_1_3) ? (var_1_10 == ((signed short int) var_1_19)) : 1))) && (var_1_9 ? (var_1_16 == ((signed short int) ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) : 1)) && (var_1_18 == ((signed short int) var_1_19))) && (var_1_19 == ((signed char) -2)) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=-2147483649, var_1_6=-2147483649, var_1_7=-4294967298, var_1_8=-2147483649, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, 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, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:39:18,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0aa738c81893cf9e45d2ce8fedb94e44410f7bdb3842bfdfce6f2126b53b412a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:39:20,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:39:20,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:39:20,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:39:20,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:39:20,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:39:20,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:39:20,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:39:20,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:39:20,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:39:20,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:39:20,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:39:20,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:39:20,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:39:20,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:39:20,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:39:20,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:39:20,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:39:20,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:39:20,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:39:20,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:39:20,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:39:20,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:39:20,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:39:20,537 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:39:20,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:39:20,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:39:20,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:39:20,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:39:20,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:39:20,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:39:20,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:39:20,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:39:20,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:39:20,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:20,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:39:20,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:39:20,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:39:20,541 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:39:20,541 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:39:20,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:39:20,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:39:20,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:39:20,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:39:20,543 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:39:20,543 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-clean/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-clean/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 -> 0aa738c81893cf9e45d2ce8fedb94e44410f7bdb3842bfdfce6f2126b53b412a [2024-10-11 12:39:20,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:39:20,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:39:20,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:39:20,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:39:20,915 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:39:20,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:22,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:39:22,692 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:39:22,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:22,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b4be5dc7/be03dab9227a46f28a9dc8cab5c12db5/FLAG4397cec78 [2024-10-11 12:39:23,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b4be5dc7/be03dab9227a46f28a9dc8cab5c12db5 [2024-10-11 12:39:23,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:39:23,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:39:23,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:23,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:39:23,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:39:23,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c9ff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23, skipping insertion in model container [2024-10-11 12:39:23,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:39:23,292 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i[915,928] [2024-10-11 12:39:23,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:23,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:39:23,380 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-74.i[915,928] [2024-10-11 12:39:23,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:39:23,432 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:39:23,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23 WrapperNode [2024-10-11 12:39:23,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:39:23,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:23,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:39:23,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:39:23,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,492 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 12:39:23,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:39:23,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:39:23,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:39:23,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:39:23,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,526 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:39:23,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:39:23,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:39:23,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:39:23,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:39:23,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (1/1) ... [2024-10-11 12:39:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:39:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:39:23,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:39:23,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:39:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:39:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:39:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:39:23,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:39:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:39:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:39:23,714 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:39:23,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:39:24,163 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:39:24,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:39:24,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:39:24,250 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:39:24,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:24 BoogieIcfgContainer [2024-10-11 12:39:24,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:39:24,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:39:24,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:39:24,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:39:24,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:39:23" (1/3) ... [2024-10-11 12:39:24,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17084fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:24, skipping insertion in model container [2024-10-11 12:39:24,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:39:23" (2/3) ... [2024-10-11 12:39:24,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17084fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:39:24, skipping insertion in model container [2024-10-11 12:39:24,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:39:24" (3/3) ... [2024-10-11 12:39:24,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-74.i [2024-10-11 12:39:24,278 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:39:24,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:39:24,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:39:24,351 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;@33ac3c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:39:24,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:39:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:39:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 12:39:24,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:24,369 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:24,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash -842173767, now seen corresponding path program 1 times [2024-10-11 12:39:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849704492] [2024-10-11 12:39:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:24,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:24,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:24,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:39:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:24,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:39:24,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:39:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-11 12:39:24,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:39:24,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:39:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849704492] [2024-10-11 12:39:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849704492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:39:24,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:39:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:39:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390549491] [2024-10-11 12:39:24,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:39:24,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:39:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:39:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:39:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:24,736 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 12:39:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:39:24,842 INFO L93 Difference]: Finished difference Result 85 states and 144 transitions. [2024-10-11 12:39:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:39:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-10-11 12:39:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:39:24,854 INFO L225 Difference]: With dead ends: 85 [2024-10-11 12:39:24,854 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 12:39:24,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:39:24,860 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:39:24,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:39:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 12:39:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 12:39:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 12:39:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-11 12:39:24,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 90 [2024-10-11 12:39:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:39:24,899 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-11 12:39:24,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 12:39:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-11 12:39:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 12:39:24,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:39:24,903 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:39:24,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:39:25,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:25,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:39:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:39:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1333153197, now seen corresponding path program 1 times [2024-10-11 12:39:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:39:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362242596] [2024-10-11 12:39:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:39:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:39:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:39:25,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:39:25,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:39:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:39:25,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:39:25,314 INFO L278 TraceCheckSpWp]: Computing forward predicates...