./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:32,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:32,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:19:32,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:32,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:32,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:32,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:32,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:32,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:32,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:32,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:32,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:32,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:32,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:32,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:32,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:32,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:32,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:32,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:19:32,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:32,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:32,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:32,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:32,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:32,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:32,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:32,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:32,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:32,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:32,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:32,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:32,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:32,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:32,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:32,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:32,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:32,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:19:32,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:19:32,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:32,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:32,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:32,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:32,695 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2024-11-10 08:19:32,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:32,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:32,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:32,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:33,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:33,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:34,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:34,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:34,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:34,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4474e4d/d6552f7c4c0945d3b32d44cdae07dc74/FLAG4262177e3 [2024-11-10 08:19:34,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4474e4d/d6552f7c4c0945d3b32d44cdae07dc74 [2024-11-10 08:19:34,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:34,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:34,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:34,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:34,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:34,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:34" (1/1) ... [2024-11-10 08:19:34,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8a0eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:34, skipping insertion in model container [2024-11-10 08:19:34,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:34" (1/1) ... [2024-11-10 08:19:34,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:34,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-11-10 08:19:34,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:35,004 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:35,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-11-10 08:19:35,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:35,059 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:35,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35 WrapperNode [2024-11-10 08:19:35,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:35,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:35,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:35,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:35,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,109 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-10 08:19:35,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:35,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:35,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:35,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:35,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:19:35,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:35,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:35,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:35,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:35,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (1/1) ... [2024-11-10 08:19:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:35,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:19:35,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:19:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:35,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:19:35,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:35,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:35,338 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:35,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:35,601 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:35,602 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:35,616 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:35,616 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:35,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:35 BoogieIcfgContainer [2024-11-10 08:19:35,617 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:35,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:35,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:35,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:35,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:34" (1/3) ... [2024-11-10 08:19:35,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bc8efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:35, skipping insertion in model container [2024-11-10 08:19:35,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:35" (2/3) ... [2024-11-10 08:19:35,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bc8efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:35, skipping insertion in model container [2024-11-10 08:19:35,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:35" (3/3) ... [2024-11-10 08:19:35,631 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:35,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:35,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:35,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:35,713 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;@6ec41872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:35,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:35,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:35,728 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:35,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 262138272, now seen corresponding path program 1 times [2024-11-10 08:19:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548793742] [2024-11-10 08:19:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:19:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:19:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:19:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:19:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:19:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:19:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:19:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:19:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:19:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:19:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:19:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 08:19:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:19:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548793742] [2024-11-10 08:19:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548793742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527531014] [2024-11-10 08:19:36,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:19:36,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:36,068 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:19:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:36,089 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2024-11-10 08:19:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2024-11-10 08:19:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:36,100 INFO L225 Difference]: With dead ends: 74 [2024-11-10 08:19:36,101 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 08:19:36,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:36,111 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:36,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 08:19:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 08:19:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-10 08:19:36,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 73 [2024-11-10 08:19:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:36,160 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-10 08:19:36,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:19:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-10 08:19:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:36,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:36,164 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:19:36,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1737614879, now seen corresponding path program 1 times [2024-11-10 08:19:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:19:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189767454] [2024-11-10 08:19:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:19:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:36,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:19:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:19:36,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:19:36,489 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:19:36,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:36,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:19:36,496 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:19:36,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:36,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:36 BoogieIcfgContainer [2024-11-10 08:19:36,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:36,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:36,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:36,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:36,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:35" (3/4) ... [2024-11-10 08:19:36,575 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:19:36,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:36,578 INFO L158 Benchmark]: Toolchain (without parser) took 1842.56ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 121.1MB in the end (delta: -8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:36,579 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:36,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.17ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:19:36,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.36ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:36,581 INFO L158 Benchmark]: Boogie Preprocessor took 42.38ms. Allocated memory is still 161.5MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:36,581 INFO L158 Benchmark]: IcfgBuilder took 463.69ms. Allocated memory is still 161.5MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:19:36,582 INFO L158 Benchmark]: TraceAbstraction took 948.53ms. Allocated memory is still 161.5MB. Free memory was 81.4MB in the beginning and 121.1MB in the end (delta: -39.7MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-10 08:19:36,585 INFO L158 Benchmark]: Witness Printer took 5.47ms. Allocated memory is still 161.5MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:36,586 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.20ms. Allocated memory is still 161.5MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.17ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.36ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 97.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.38ms. Allocated memory is still 161.5MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 463.69ms. Allocated memory is still 161.5MB. Free memory was 96.1MB in the beginning and 82.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 948.53ms. Allocated memory is still 161.5MB. Free memory was 81.4MB in the beginning and 121.1MB in the end (delta: -39.7MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Witness Printer took 5.47ms. Allocated memory is still 161.5MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_3 = 64; [L24] signed long int var_1_4 = 5; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 0; [L29] float var_1_9 = 256.75; [L30] float var_1_10 = 99.2; VAL [isInitial=0, var_1_10=496/5, var_1_1=1, var_1_3=64, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L46] var_1_3 = __VERIFIER_nondet_ushort() [L47] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L47] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L49] var_1_4 = __VERIFIER_nondet_long() [L50] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L50] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L52] var_1_5 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L53] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L55] var_1_6 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L56] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L58] var_1_7 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L59] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L60] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L60] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L62] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L75] RET updateVariables() [L76] CALL step() [L34] var_1_8 = var_1_3 [L35] var_1_9 = var_1_10 [L36] signed long int stepLocal_0 = 10 - var_1_4; VAL [isInitial=1, stepLocal_0=10, var_1_10=65540, var_1_1=1, var_1_3=65535, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L37] COND TRUE (var_1_8 + var_1_8) > stepLocal_0 [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return ((((var_1_8 + var_1_8) > (10 - var_1_4)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) (var_1_6 || var_1_7))) : 1)) && (var_1_8 == ((unsigned long int) var_1_3))) && (var_1_9 == ((float) var_1_10)) ; VAL [\result=0, isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] [L19] reach_error() VAL [isInitial=1, var_1_10=65540, var_1_1=-255, var_1_3=65535, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=65535, var_1_9=65540] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 11, 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, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 48 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:19:36,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:19:38,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:19:38,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:19:38,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:19:38,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:19:38,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:19:39,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:19:39,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:19:39,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:19:39,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:19:39,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:19:39,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:19:39,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:19:39,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:19:39,007 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:19:39,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:19:39,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:19:39,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:19:39,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:19:39,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:19:39,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:19:39,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:19:39,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:19:39,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:19:39,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:19:39,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:19:39,013 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:19:39,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:19:39,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:19:39,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:19:39,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:19:39,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:19:39,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:19:39,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:19:39,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:39,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:19:39,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:19:39,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:19:39,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:19:39,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:19:39,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:19:39,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:19:39,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:19:39,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:19:39,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2024-11-10 08:19:39,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:19:39,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:19:39,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:19:39,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:19:39,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:19:39,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:40,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:19:41,111 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:19:41,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:41,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b00ec27/f076551434064647ba22af64d737b05f/FLAGa9c451f59 [2024-11-10 08:19:41,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b00ec27/f076551434064647ba22af64d737b05f [2024-11-10 08:19:41,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:19:41,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:19:41,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:41,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:19:41,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:19:41,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a60feb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41, skipping insertion in model container [2024-11-10 08:19:41,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:19:41,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-11-10 08:19:41,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:41,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:19:41,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-11-10 08:19:41,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:19:41,503 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:19:41,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41 WrapperNode [2024-11-10 08:19:41,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:19:41,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:41,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:19:41,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:19:41,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,552 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2024-11-10 08:19:41,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:19:41,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:19:41,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:19:41,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:19:41,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:19:41,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:19:41,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:19:41,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:19:41,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:19:41,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (1/1) ... [2024-11-10 08:19:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:19:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:19:41,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:19:41,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:19:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:19:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:19:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:19:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:19:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:19:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:19:41,747 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:19:41,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:19:41,996 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:19:41,996 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:19:42,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:19:42,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:19:42,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:42 BoogieIcfgContainer [2024-11-10 08:19:42,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:19:42,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:19:42,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:19:42,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:19:42,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:19:41" (1/3) ... [2024-11-10 08:19:42,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c7facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:42, skipping insertion in model container [2024-11-10 08:19:42,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:19:41" (2/3) ... [2024-11-10 08:19:42,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c7facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:19:42, skipping insertion in model container [2024-11-10 08:19:42,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:42" (3/3) ... [2024-11-10 08:19:42,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2024-11-10 08:19:42,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:19:42,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:19:42,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:19:42,120 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;@59ffbc19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:19:42,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:19:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:42,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:42,140 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:42,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 262138272, now seen corresponding path program 1 times [2024-11-10 08:19:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:42,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059282421] [2024-11-10 08:19:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:42,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:42,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:42,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:19:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:42,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:19:42,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-10 08:19:42,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:19:42,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059282421] [2024-11-10 08:19:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059282421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:19:42,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:19:42,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:19:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929522288] [2024-11-10 08:19:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:42,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:19:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:19:42,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:42,422 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:19:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:42,447 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2024-11-10 08:19:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:19:42,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2024-11-10 08:19:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:42,457 INFO L225 Difference]: With dead ends: 74 [2024-11-10 08:19:42,457 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 08:19:42,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:19:42,473 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:42,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:19:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 08:19:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 08:19:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-10 08:19:42,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 73 [2024-11-10 08:19:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-10 08:19:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 08:19:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-10 08:19:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:19:42,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:42,525 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:42,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:19:42,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:42,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1737614879, now seen corresponding path program 1 times [2024-11-10 08:19:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881503868] [2024-11-10 08:19:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:42,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:42,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:42,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:42,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:19:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:42,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 08:19:42,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-10 08:19:45,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 08:19:46,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881503868] [2024-11-10 08:19:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881503868] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:19:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2024-11-10 08:19:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833348961] [2024-11-10 08:19:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:46,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:19:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:19:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-10 08:19:46,816 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:19:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:47,358 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-10 08:19:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:19:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2024-11-10 08:19:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:47,363 INFO L225 Difference]: With dead ends: 55 [2024-11-10 08:19:47,363 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 08:19:47,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-10 08:19:47,365 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:47,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 151 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:19:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 08:19:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2024-11-10 08:19:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-11-10 08:19:47,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 73 [2024-11-10 08:19:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:47,381 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-10 08:19:47,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:19:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-11-10 08:19:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:47,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:47,383 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:47,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:19:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:47,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 781792520, now seen corresponding path program 1 times [2024-11-10 08:19:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:47,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769790498] [2024-11-10 08:19:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:47,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:47,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:47,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 08:19:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:47,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 08:19:47,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-10 08:19:47,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 08:19:47,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769790498] [2024-11-10 08:19:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769790498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:19:47,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:19:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 08:19:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734553991] [2024-11-10 08:19:47,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:19:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:19:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:19:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:19:47,903 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:19:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:48,018 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-10 08:19:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:19:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 74 [2024-11-10 08:19:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:48,020 INFO L225 Difference]: With dead ends: 89 [2024-11-10 08:19:48,021 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 08:19:48,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:19:48,022 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:48,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 71 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:19:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 08:19:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-10 08:19:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 08:19:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-10 08:19:48,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 74 [2024-11-10 08:19:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-10 08:19:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:19:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-10 08:19:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:19:48,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:19:48,042 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:19:48,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 08:19:48,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:48,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:19:48,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:19:48,245 INFO L85 PathProgramCache]: Analyzing trace with hash 753163369, now seen corresponding path program 1 times [2024-11-10 08:19:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:19:48,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924688099] [2024-11-10 08:19:48,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:19:48,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:19:48,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:19:48,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 08:19:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:19:48,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 08:19:48,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:19:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-10 08:19:50,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:19:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-10 08:19:51,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:19:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924688099] [2024-11-10 08:19:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924688099] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:19:51,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:19:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 22 [2024-11-10 08:19:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243027166] [2024-11-10 08:19:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:19:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:19:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:19:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:19:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-10 08:19:51,791 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:19:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:19:52,302 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-10 08:19:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:19:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-10 08:19:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:19:52,304 INFO L225 Difference]: With dead ends: 55 [2024-11-10 08:19:52,304 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:19:52,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:19:52,306 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:19:52,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 141 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:19:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:19:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:19:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:19:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:19:52,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-11-10 08:19:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:19:52,308 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:19:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 08:19:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:19:52,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:19:52,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:19:52,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 08:19:52,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:19:52,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 08:19:52,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:19:52,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:19:53,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-10 08:19:53,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-10 08:19:53,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:19:53 BoogieIcfgContainer [2024-11-10 08:19:53,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:19:53,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:19:53,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:19:53,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:19:53,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:19:42" (3/4) ... [2024-11-10 08:19:53,017 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:19:53,021 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:19:53,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:19:53,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:19:53,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:19:53,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:19:53,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:19:53,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:19:53,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:19:53,130 INFO L158 Benchmark]: Toolchain (without parser) took 11978.31ms. Allocated memory was 69.2MB in the beginning and 457.2MB in the end (delta: 388.0MB). Free memory was 39.8MB in the beginning and 315.9MB in the end (delta: -276.2MB). Peak memory consumption was 110.2MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,130 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:19:53,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.86ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 43.8MB in the end (delta: -4.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 69.2MB. Free memory was 43.8MB in the beginning and 42.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,131 INFO L158 Benchmark]: Boogie Preprocessor took 51.50ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 40.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,131 INFO L158 Benchmark]: IcfgBuilder took 410.06ms. Allocated memory is still 69.2MB. Free memory was 39.7MB in the beginning and 47.5MB in the end (delta: -7.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,132 INFO L158 Benchmark]: TraceAbstraction took 10995.53ms. Allocated memory was 69.2MB in the beginning and 457.2MB in the end (delta: 388.0MB). Free memory was 46.9MB in the beginning and 321.2MB in the end (delta: -274.3MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,132 INFO L158 Benchmark]: Witness Printer took 115.80ms. Allocated memory is still 457.2MB. Free memory was 321.2MB in the beginning and 315.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:19:53,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.86ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 43.8MB in the end (delta: -4.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.68ms. Allocated memory is still 69.2MB. Free memory was 43.8MB in the beginning and 42.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.50ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 40.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 410.06ms. Allocated memory is still 69.2MB. Free memory was 39.7MB in the beginning and 47.5MB in the end (delta: -7.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10995.53ms. Allocated memory was 69.2MB in the beginning and 457.2MB in the end (delta: 388.0MB). Free memory was 46.9MB in the beginning and 321.2MB in the end (delta: -274.3MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. * Witness Printer took 115.80ms. Allocated memory is still 457.2MB. Free memory was 321.2MB in the beginning and 315.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 4, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 156 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 508 ConstructedInterpolants, 9 QuantifiedInterpolants, 2073 SizeOfPredicates, 30 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1462/1540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:19:53,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE