./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.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 f1648fbf8a6e9a12fa966e41ca01aa2c551b0fd9acc65986e1ec4cee749b3435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:02:01,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:02:01,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:02:01,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:02:01,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:02:01,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:02:01,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:02:01,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:02:01,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:02:01,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:02:01,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:02:01,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:02:01,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:02:01,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:02:01,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:02:01,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:02:01,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:02:01,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:02:01,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:02:01,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:02:01,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:02:01,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:02:01,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:02:01,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:02:01,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:02:01,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:02:01,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:02:01,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:02:01,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:02:01,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:02:01,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:02:01,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:02:01,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:02:01,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:02:01,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:02:01,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:02:01,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:02:01,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:02:01,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:02:01,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:02:01,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:02:01,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:02:01,652 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 -> f1648fbf8a6e9a12fa966e41ca01aa2c551b0fd9acc65986e1ec4cee749b3435 [2024-11-12 07:02:01,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:02:01,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:02:01,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:02:01,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:02:01,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:02:01,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:03,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:02:03,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:02:03,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:03,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b5eba44/1ba1ee14d64a4dfbb1b3c1b19c2e4fa9/FLAGfea74908a [2024-11-12 07:02:03,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b5eba44/1ba1ee14d64a4dfbb1b3c1b19c2e4fa9 [2024-11-12 07:02:03,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:02:03,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:02:03,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:02:03,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:02:03,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:02:03,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:03" (1/1) ... [2024-11-12 07:02:03,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f52c8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:03, skipping insertion in model container [2024-11-12 07:02:03,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:03" (1/1) ... [2024-11-12 07:02:03,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:02:03,929 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_variablewrapping_normal_file-7.i[912,925] [2024-11-12 07:02:03,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:02:04,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:02:04,020 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_variablewrapping_normal_file-7.i[912,925] [2024-11-12 07:02:04,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:02:04,063 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:02:04,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04 WrapperNode [2024-11-12 07:02:04,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:02:04,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:02:04,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:02:04,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:02:04,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,118 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-12 07:02:04,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:02:04,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:02:04,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:02:04,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:02:04,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 07:02:04,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:02:04,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:02:04,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:02:04,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:02:04,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (1/1) ... [2024-11-12 07:02:04,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:02:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:02:04,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:02:04,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:02:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:02:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:02:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:02:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:02:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:02:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:02:04,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:02:04,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:02:04,638 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 07:02:04,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:02:04,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:02:04,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:02:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:04 BoogieIcfgContainer [2024-11-12 07:02:04,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:02:04,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:02:04,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:02:04,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:02:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:02:03" (1/3) ... [2024-11-12 07:02:04,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d044652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:04, skipping insertion in model container [2024-11-12 07:02:04,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:04" (2/3) ... [2024-11-12 07:02:04,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d044652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:04, skipping insertion in model container [2024-11-12 07:02:04,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:04" (3/3) ... [2024-11-12 07:02:04,668 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:04,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:02:04,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:02:04,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:02:04,747 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;@2d2693a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:02:04,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:02:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:02:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:02:04,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:04,761 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:04,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 533118968, now seen corresponding path program 1 times [2024-11-12 07:02:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:02:04,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767502571] [2024-11-12 07:02:04,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:02:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:02:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:02:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:02:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 07:02:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 07:02:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 07:02:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 07:02:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:02:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 07:02:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 07:02:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 07:02:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 07:02:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:02:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:02:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767502571] [2024-11-12 07:02:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767502571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:02:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142678796] [2024-11-12 07:02:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:02:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:02:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:02:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:02:05,162 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:02:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:05,192 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-11-12 07:02:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:02:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-12 07:02:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:05,203 INFO L225 Difference]: With dead ends: 83 [2024-11-12 07:02:05,203 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 07:02:05,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:02:05,213 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:05,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:02:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 07:02:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 07:02:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:02:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-12 07:02:05,254 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2024-11-12 07:02:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:05,254 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-12 07:02:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:02:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-12 07:02:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:02:05,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:05,258 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:02:05,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1417074868, now seen corresponding path program 1 times [2024-11-12 07:02:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:02:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043879223] [2024-11-12 07:02:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:02:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:02:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590645169] [2024-11-12 07:02:05,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:05,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:02:05,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:02:05,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:02:05,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:02:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:02:05,682 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:02:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:02:05,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:02:05,815 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:02:05,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:02:05,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:02:06,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:02:06,026 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 07:02:06,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:02:06,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:02:06 BoogieIcfgContainer [2024-11-12 07:02:06,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:02:06,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:02:06,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:02:06,107 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:02:06,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:04" (3/4) ... [2024-11-12 07:02:06,112 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:02:06,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:02:06,114 INFO L158 Benchmark]: Toolchain (without parser) took 2411.82ms. Allocated memory is still 190.8MB. Free memory was 121.4MB in the beginning and 84.5MB in the end (delta: 36.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-12 07:02:06,115 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 190.8MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:02:06,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.59ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 106.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:02:06,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.81ms. Allocated memory is still 190.8MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:02:06,117 INFO L158 Benchmark]: Boogie Preprocessor took 102.93ms. Allocated memory is still 190.8MB. Free memory was 104.2MB in the beginning and 160.0MB in the end (delta: -55.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-12 07:02:06,118 INFO L158 Benchmark]: RCFGBuilder took 434.42ms. Allocated memory is still 190.8MB. Free memory was 160.0MB in the beginning and 142.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:02:06,119 INFO L158 Benchmark]: TraceAbstraction took 1445.86ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 85.5MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-12 07:02:06,119 INFO L158 Benchmark]: Witness Printer took 6.90ms. Allocated memory is still 190.8MB. Free memory was 85.5MB in the beginning and 84.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:02:06,122 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 190.8MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.59ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 106.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.81ms. Allocated memory is still 190.8MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 102.93ms. Allocated memory is still 190.8MB. Free memory was 104.2MB in the beginning and 160.0MB in the end (delta: -55.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 434.42ms. Allocated memory is still 190.8MB. Free memory was 160.0MB in the beginning and 142.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1445.86ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 85.5MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 6.90ms. Allocated memory is still 190.8MB. Free memory was 85.5MB in the beginning and 84.5MB in the end (delta: 1.0MB). 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 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] float var_1_3 = 8.2; [L24] float var_1_4 = 100000000000.4; [L25] unsigned char var_1_6 = 4; [L26] double var_1_7 = 0.2; [L27] unsigned char var_1_8 = 0; [L28] unsigned short int var_1_9 = 32; [L29] unsigned char var_1_10 = 1; [L30] double var_1_11 = 127.5; [L31] unsigned long int var_1_12 = 5; [L32] double last_1_var_1_7 = 0.2; [L33] unsigned long int last_1_var_1_12 = 5; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L89] last_1_var_1_7 = var_1_7 [L90] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_3=41/5, var_1_4=500000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L68] var_1_3 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=500000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=500000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L69] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_4=500000000002/5, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L71] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=4, var_1_7=1/5, var_1_8=0, var_1_9=32] [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L74] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_9=32] [L77] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L77] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=32] [L78] var_1_9 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L80] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L80] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0] [L81] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L81] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=255/2, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L86] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=1, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L101] RET updateVariables() [L102] CALL step() [L37] COND FALSE !(! (last_1_var_1_7 <= (var_1_3 - var_1_4))) [L44] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_12=5, var_1_1=2, var_1_6=2, var_1_7=1/5, var_1_8=0, var_1_9=-131070] [L46] COND FALSE !(var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) [L53] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=5, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L55] COND FALSE !(\read(var_1_8)) [L64] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return (((! (last_1_var_1_7 <= (var_1_3 - var_1_4))) ? ((-1 < last_1_var_1_12) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_8 || ((var_1_6 / var_1_9) >= var_1_1)) ? ((var_1_8 && var_1_10) ? (var_1_7 == ((double) var_1_11)) : (var_1_7 == ((double) var_1_11))) : (var_1_7 == ((double) var_1_11)))) && (var_1_8 ? ((var_1_10 && (var_1_4 <= var_1_7)) ? ((((((var_1_4) > (var_1_11)) ? (var_1_4) : (var_1_11))) > var_1_7) ? (var_1_12 == ((unsigned long int) ((((((3725801564u - var_1_6) - var_1_1)) > (var_1_9)) ? (((3725801564u - var_1_6) - var_1_1)) : (var_1_9))))) : (var_1_12 == ((unsigned long int) var_1_6))) : 1) : (var_1_12 == ((unsigned long int) var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10=1, var_1_11=2, var_1_12=2, var_1_1=2, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=-131070] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 07:02:06,161 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_variablewrapping_normal_file-7.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 f1648fbf8a6e9a12fa966e41ca01aa2c551b0fd9acc65986e1ec4cee749b3435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:02:08,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:02:08,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:02:08,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:02:08,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:02:08,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:02:08,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:02:08,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:02:08,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:02:08,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:02:08,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:02:08,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:02:08,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:02:08,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:02:08,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:02:08,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:02:08,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:02:08,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:02:08,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:02:08,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:02:08,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:02:08,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:02:08,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:02:08,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:02:08,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:02:08,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:02:08,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:02:08,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:02:08,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:02:08,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:02:08,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:02:08,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:02:08,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:02:08,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:02:08,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:02:08,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:02:08,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:02:08,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:02:08,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:02:08,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:02:08,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:02:08,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:02:08,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:02:08,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:02:08,616 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 -> f1648fbf8a6e9a12fa966e41ca01aa2c551b0fd9acc65986e1ec4cee749b3435 [2024-11-12 07:02:08,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:02:08,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:02:09,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:02:09,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:02:09,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:02:09,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:10,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:02:11,034 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:02:11,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:11,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc52d42/ff375b75400a4fa8a12a5f5b59091b31/FLAG3fef0728e [2024-11-12 07:02:11,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cc52d42/ff375b75400a4fa8a12a5f5b59091b31 [2024-11-12 07:02:11,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:02:11,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:02:11,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:02:11,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:02:11,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:02:11,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729f246c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11, skipping insertion in model container [2024-11-12 07:02:11,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:02:11,339 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_variablewrapping_normal_file-7.i[912,925] [2024-11-12 07:02:11,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:02:11,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:02:11,424 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_variablewrapping_normal_file-7.i[912,925] [2024-11-12 07:02:11,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:02:11,482 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:02:11,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11 WrapperNode [2024-11-12 07:02:11,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:02:11,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:02:11,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:02:11,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:02:11,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,540 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-12 07:02:11,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:02:11,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:02:11,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:02:11,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:02:11,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,581 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 07:02:11,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:02:11,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:02:11,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:02:11,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:02:11,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (1/1) ... [2024-11-12 07:02:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:02:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:02:11,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:02:11,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:02:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:02:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:02:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:02:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:02:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:02:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:02:11,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:02:11,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:02:12,779 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 07:02:12,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:02:12,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:02:12,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:02:12,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:12 BoogieIcfgContainer [2024-11-12 07:02:12,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:02:12,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:02:12,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:02:12,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:02:12,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:02:11" (1/3) ... [2024-11-12 07:02:12,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac68fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:12, skipping insertion in model container [2024-11-12 07:02:12,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:02:11" (2/3) ... [2024-11-12 07:02:12,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ac68fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:02:12, skipping insertion in model container [2024-11-12 07:02:12,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:12" (3/3) ... [2024-11-12 07:02:12,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-7.i [2024-11-12 07:02:12,830 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:02:12,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:02:12,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:02:12,902 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;@55166acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:02:12,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:02:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:02:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:02:12,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:12,916 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:12,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:12,923 INFO L85 PathProgramCache]: Analyzing trace with hash 533118968, now seen corresponding path program 1 times [2024-11-12 07:02:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668250823] [2024-11-12 07:02:12,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:12,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:12,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:12,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:02:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:13,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:02:13,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-12 07:02:13,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:13,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668250823] [2024-11-12 07:02:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668250823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:13,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:13,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:02:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304242680] [2024-11-12 07:02:13,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:13,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:02:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:02:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:02:13,290 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:02:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:13,318 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-11-12 07:02:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:02:13,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-12 07:02:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:13,328 INFO L225 Difference]: With dead ends: 83 [2024-11-12 07:02:13,329 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 07:02:13,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:02:13,340 INFO L435 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:13,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:02:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 07:02:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 07:02:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:02:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-12 07:02:13,375 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 79 [2024-11-12 07:02:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-12 07:02:13,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:02:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-12 07:02:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:02:13,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:13,378 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:13,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:02:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:13,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:13,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1417074868, now seen corresponding path program 1 times [2024-11-12 07:02:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156820098] [2024-11-12 07:02:13,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:13,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:13,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:13,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:13,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:02:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:13,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 07:02:13,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:02:20,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:20,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156820098] [2024-11-12 07:02:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156820098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:02:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093564343] [2024-11-12 07:02:20,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:20,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:02:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:02:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:02:20,374 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:22,605 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2024-11-12 07:02:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 07:02:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-11-12 07:02:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:22,608 INFO L225 Difference]: With dead ends: 110 [2024-11-12 07:02:22,608 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 07:02:22,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:02:22,611 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:22,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 173 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 07:02:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 07:02:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-11-12 07:02:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 07:02:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-11-12 07:02:22,630 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 79 [2024-11-12 07:02:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-11-12 07:02:22,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-11-12 07:02:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:02:22,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:22,634 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:22,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:02:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:22,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:22,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1809173135, now seen corresponding path program 1 times [2024-11-12 07:02:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798437696] [2024-11-12 07:02:22,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:22,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:22,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:02:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:23,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:02:23,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:02:23,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:23,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798437696] [2024-11-12 07:02:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798437696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:02:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632395121] [2024-11-12 07:02:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:02:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:02:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:02:23,044 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:23,185 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2024-11-12 07:02:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:02:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-12 07:02:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:23,189 INFO L225 Difference]: With dead ends: 132 [2024-11-12 07:02:23,189 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 07:02:23,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:02:23,191 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:23,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:02:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 07:02:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-11-12 07:02:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:02:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-11-12 07:02:23,205 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 80 [2024-11-12 07:02:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:23,206 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-11-12 07:02:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-11-12 07:02:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:02:23,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:23,208 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:23,223 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-12 07:02:23,409 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-12 07:02:23,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1866431437, now seen corresponding path program 1 times [2024-11-12 07:02:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349181127] [2024-11-12 07:02:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:23,417 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-12 07:02:23,419 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-12 07:02:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:23,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 07:02:23,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:02:27,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:27,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349181127] [2024-11-12 07:02:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349181127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:27,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:02:27,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098671398] [2024-11-12 07:02:27,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:27,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:02:27,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:02:27,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:02:27,381 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:29,854 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-12 07:02:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 07:02:29,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-12 07:02:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:29,856 INFO L225 Difference]: With dead ends: 86 [2024-11-12 07:02:29,856 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 07:02:29,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:02:29,858 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:29,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 164 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 07:02:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 07:02:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2024-11-12 07:02:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:02:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-12 07:02:29,871 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 80 [2024-11-12 07:02:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:29,871 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-12 07:02:29,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2024-11-12 07:02:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 07:02:29,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:29,873 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:29,886 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:02:30,074 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-12 07:02:30,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash -155695824, now seen corresponding path program 1 times [2024-11-12 07:02:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:30,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147985296] [2024-11-12 07:02:30,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:30,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:30,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:30,078 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 (6)] Waiting until timeout for monitored process [2024-11-12 07:02:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:30,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 07:02:30,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:02:35,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:35,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:35,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147985296] [2024-11-12 07:02:35,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147985296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:35,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:35,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:02:35,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875726783] [2024-11-12 07:02:35,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:35,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:02:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:02:35,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:02:35,072 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:43,469 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2024-11-12 07:02:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:02:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 07:02:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:43,472 INFO L225 Difference]: With dead ends: 113 [2024-11-12 07:02:43,472 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:02:43,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:02:43,473 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:43,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 224 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 07:02:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:02:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2024-11-12 07:02:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:02:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-11-12 07:02:43,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 81 [2024-11-12 07:02:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:43,501 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-11-12 07:02:43,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-11-12 07:02:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 07:02:43,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:43,504 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:43,518 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 (6)] Ended with exit code 0 [2024-11-12 07:02:43,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:43,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:43,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:43,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1619311538, now seen corresponding path program 1 times [2024-11-12 07:02:43,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:43,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492967760] [2024-11-12 07:02:43,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:43,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:43,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:43,709 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 (7)] Waiting until timeout for monitored process [2024-11-12 07:02:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 07:02:43,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:02:46,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:46,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492967760] [2024-11-12 07:02:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492967760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:02:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015738268] [2024-11-12 07:02:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:02:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:02:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:02:46,050 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:02:48,919 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2024-11-12 07:02:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:02:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-12 07:02:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:02:48,921 INFO L225 Difference]: With dead ends: 188 [2024-11-12 07:02:48,921 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 07:02:48,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:02:48,923 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:02:48,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 208 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 07:02:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 07:02:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2024-11-12 07:02:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 68 states have internal predecessors, (72), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:02:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-11-12 07:02:48,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 81 [2024-11-12 07:02:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:02:48,937 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-11-12 07:02:48,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:02:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-11-12 07:02:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 07:02:48,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:02:48,939 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:02:48,960 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:02:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:49,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:02:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:02:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -768087066, now seen corresponding path program 1 times [2024-11-12 07:02:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:02:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649583541] [2024-11-12 07:02:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:02:49,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:02:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:02:49,143 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:02:49,145 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:02:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:02:49,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 07:02:49,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:02:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:02:57,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:02:57,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:02:57,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649583541] [2024-11-12 07:02:57,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649583541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:02:57,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:02:57,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:02:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033650282] [2024-11-12 07:02:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:02:57,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:02:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:02:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:02:57,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:02:57,742 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:03:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:03:13,410 INFO L93 Difference]: Finished difference Result 193 states and 230 transitions. [2024-11-12 07:03:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:03:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-12 07:03:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:03:13,414 INFO L225 Difference]: With dead ends: 193 [2024-11-12 07:03:13,414 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 07:03:13,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:03:13,416 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:03:13,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 251 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-12 07:03:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 07:03:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 07:03:13,417 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-12 07:03:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 07:03:13,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-11-12 07:03:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:03:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 07:03:13,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:03:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 07:03:13,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 07:03:13,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:03:13,431 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 (8)] Ended with exit code 0 [2024-11-12 07:03:13,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:03:13,625 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:03:13,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 07:03:20,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:03:20,335 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,335 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 07:03:20,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 07:03:20,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 07:03:20,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 07:03:20,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:03:20 BoogieIcfgContainer [2024-11-12 07:03:20,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:03:20,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:03:20,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:03:20,350 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:03:20,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:02:12" (3/4) ... [2024-11-12 07:03:20,354 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 07:03:20,358 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 07:03:20,363 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 07:03:20,363 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 07:03:20,363 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 07:03:20,363 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 07:03:20,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 07:03:20,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 07:03:20,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:03:20,463 INFO L158 Benchmark]: Toolchain (without parser) took 69384.83ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 37.5MB in the beginning and 141.2MB in the end (delta: -103.8MB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,463 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:03:20,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.45ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 40.5MB in the end (delta: -3.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.10ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,464 INFO L158 Benchmark]: Boogie Preprocessor took 80.43ms. Allocated memory is still 71.3MB. Free memory was 38.8MB in the beginning and 35.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,464 INFO L158 Benchmark]: RCFGBuilder took 1178.29ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 45.8MB in the end (delta: -9.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,464 INFO L158 Benchmark]: TraceAbstraction took 67543.00ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 45.5MB in the beginning and 147.5MB in the end (delta: -102.1MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,464 INFO L158 Benchmark]: Witness Printer took 115.20ms. Allocated memory is still 314.6MB. Free memory was 147.5MB in the beginning and 141.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:03:20,469 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.18ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.45ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 40.5MB in the end (delta: -3.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.10ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.43ms. Allocated memory is still 71.3MB. Free memory was 38.8MB in the beginning and 35.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1178.29ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 45.8MB in the end (delta: -9.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 67543.00ms. Allocated memory was 71.3MB in the beginning and 314.6MB in the end (delta: 243.3MB). Free memory was 45.5MB in the beginning and 147.5MB in the end (delta: -102.1MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. * Witness Printer took 115.20ms. Allocated memory is still 314.6MB. Free memory was 147.5MB in the beginning and 141.2MB in the end (delta: 6.3MB). 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: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.8s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 836 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 363 mSDtfsCounter, 1604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 101, 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, 7 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 50 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1848/1848 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: 99]: Loop Invariant Derived loop 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_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))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 07:03:20,640 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