./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:21:04,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:21:04,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:21:04,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:21:04,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:21:04,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:21:04,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:21:04,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:21:04,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:21:04,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:21:04,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:21:04,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:21:04,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:21:04,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:21:04,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:21:04,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:21:04,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:21:04,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:21:04,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:21:04,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:21:04,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:21:04,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:21:04,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:21:04,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:21:04,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:21:04,551 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:21:04,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:21:04,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:21:04,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:21:04,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:21:04,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:21:04,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:21:04,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:04,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:21:04,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:21:04,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:21:04,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:21:04,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:21:04,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:21:04,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:21:04,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:21:04,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:21:04,556 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2024-11-19 00:21:04,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:21:04,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:21:04,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:21:04,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:21:04,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:21:04,832 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-15.i [2024-11-19 00:21:06,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:21:06,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:21:06,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2024-11-19 00:21:06,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567d40a9b/d9e30624b236434fbe57aad444d2c8cc/FLAGae0f9b5fc [2024-11-19 00:21:06,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567d40a9b/d9e30624b236434fbe57aad444d2c8cc [2024-11-19 00:21:06,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:21:06,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:21:06,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:06,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:21:06,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:21:06,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:06,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553334f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06, skipping insertion in model container [2024-11-19 00:21:06,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:06,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:21:06,823 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-15.i[913,926] [2024-11-19 00:21:06,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:06,909 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:21:06,921 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-15.i[913,926] [2024-11-19 00:21:06,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:06,959 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:21:06,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06 WrapperNode [2024-11-19 00:21:06,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:06,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:06,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:21:06,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:21:06,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:06,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,003 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-19 00:21:07,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:07,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:21:07,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:21:07,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:21:07,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,031 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-19 00:21:07,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:21:07,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:21:07,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:21:07,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:21:07,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (1/1) ... [2024-11-19 00:21:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:07,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:21:07,109 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-19 00:21:07,113 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-19 00:21:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:21:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:21:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:21:07,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:21:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:21:07,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:21:07,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:21:07,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:21:07,538 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 00:21:07,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:21:07,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:21:07,556 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:21:07,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:07 BoogieIcfgContainer [2024-11-19 00:21:07,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:21:07,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:21:07,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:21:07,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:21:07,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:21:06" (1/3) ... [2024-11-19 00:21:07,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b29bc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:07, skipping insertion in model container [2024-11-19 00:21:07,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:06" (2/3) ... [2024-11-19 00:21:07,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b29bc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:07, skipping insertion in model container [2024-11-19 00:21:07,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:07" (3/3) ... [2024-11-19 00:21:07,566 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2024-11-19 00:21:07,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:21:07,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:21:07,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:21:07,668 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;@4078cec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:21:07,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:21:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 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-19 00:21:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:07,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:07,690 INFO L215 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-19 00:21:07,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1601258831, now seen corresponding path program 1 times [2024-11-19 00:21:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:21:07,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979166380] [2024-11-19 00:21:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:21:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:21:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:21:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979166380] [2024-11-19 00:21:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979166380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:21:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262444772] [2024-11-19 00:21:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:21:07,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:21:07,983 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-19 00:21:07,984 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-19 00:21:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:08,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:21:08,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:21:08,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262444772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:21:08,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:21:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616035810] [2024-11-19 00:21:08,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:08,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:21:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:21:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:21:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:21:08,241 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 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.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 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-19 00:21:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:08,262 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2024-11-19 00:21:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:21:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 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 82 [2024-11-19 00:21:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:08,270 INFO L225 Difference]: With dead ends: 85 [2024-11-19 00:21:08,271 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 00:21:08,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-19 00:21:08,278 INFO L432 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-19 00:21:08,279 INFO L433 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-19 00:21:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 00:21:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 00:21:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-19 00:21:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-19 00:21:08,319 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-19 00:21:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-19 00:21:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 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-19 00:21:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-19 00:21:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:08,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:08,324 INFO L215 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-19 00:21:08,342 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-19 00:21:08,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:21:08,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 109782457, now seen corresponding path program 1 times [2024-11-19 00:21:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:21:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105953316] [2024-11-19 00:21:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:21:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:09,178 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-19 00:21:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:21:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105953316] [2024-11-19 00:21:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105953316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:09,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:09,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:21:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189205672] [2024-11-19 00:21:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:09,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:21:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:21:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:21:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:21:09,184 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-19 00:21:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:09,241 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2024-11-19 00:21:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:21:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 82 [2024-11-19 00:21:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:09,243 INFO L225 Difference]: With dead ends: 95 [2024-11-19 00:21:09,243 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 00:21:09,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:21:09,247 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:09,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:21:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 00:21:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-19 00:21:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-19 00:21:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-19 00:21:09,264 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2024-11-19 00:21:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-19 00:21:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-19 00:21:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-19 00:21:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:09,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:09,273 INFO L215 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-19 00:21:09,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:21:09,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:09,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash -19505799, now seen corresponding path program 1 times [2024-11-19 00:21:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:21:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445407931] [2024-11-19 00:21:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:21:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:09,453 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-19 00:21:09,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:21:09,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445407931] [2024-11-19 00:21:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445407931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:21:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915317255] [2024-11-19 00:21:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:09,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:21:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:21:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:21:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:21:09,457 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 00:21:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:09,506 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-19 00:21:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:21:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 82 [2024-11-19 00:21:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:09,509 INFO L225 Difference]: With dead ends: 127 [2024-11-19 00:21:09,509 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 00:21:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 00:21:09,513 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:09,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:21:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 00:21:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-19 00:21:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:21:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-19 00:21:09,535 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2024-11-19 00:21:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:09,537 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-19 00:21:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-19 00:21:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-19 00:21:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 00:21:09,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:09,543 INFO L215 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, 1] [2024-11-19 00:21:09,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:21:09,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:09,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash -636021362, now seen corresponding path program 1 times [2024-11-19 00:21:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:21:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845587260] [2024-11-19 00:21:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:21:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:21:09,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:21:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:21:09,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:21:09,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:21:09,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:21:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:21:09,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 00:21:09,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:21:09,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:21:09 BoogieIcfgContainer [2024-11-19 00:21:09,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:21:09,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:21:09,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:21:09,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:21:09,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:07" (3/4) ... [2024-11-19 00:21:09,934 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:21:09,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:21:09,938 INFO L158 Benchmark]: Toolchain (without parser) took 3375.46ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 87.7MB in the beginning and 111.0MB in the end (delta: -23.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,939 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:21:09,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.41ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 116.0MB in the end (delta: -28.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 113.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,942 INFO L158 Benchmark]: Boogie Preprocessor took 53.63ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,942 INFO L158 Benchmark]: RCFGBuilder took 494.41ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 97.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,942 INFO L158 Benchmark]: TraceAbstraction took 2370.38ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 96.6MB in the beginning and 111.0MB in the end (delta: -14.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-19 00:21:09,943 INFO L158 Benchmark]: Witness Printer took 5.81ms. Allocated memory is still 195.0MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:21:09,944 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.24ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.41ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 116.0MB in the end (delta: -28.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 113.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.63ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.41ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 97.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2370.38ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 96.6MB in the beginning and 111.0MB in the end (delta: -14.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 5.81ms. Allocated memory is still 195.0MB. Free memory is still 111.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 someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = 8; [L26] unsigned long int var_1_8 = 1; [L27] unsigned long int var_1_9 = 1885310857; [L28] signed long int var_1_10 = -10; [L29] double var_1_11 = 32.6; [L30] double var_1_12 = 9.75; [L31] double var_1_13 = 5.1; [L32] double var_1_14 = 128.1; [L33] double var_1_15 = 63.9; [L34] signed long int last_1_var_1_10 = -10; VAL [isInitial=0, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=1, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=8, var_1_8=1, var_1_9=1885310857] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1885310857] [L75] var_1_9 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L76] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_12=39/4, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L79] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_13=51/10, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L81] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_14=1281/10, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L82] var_1_14 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L83] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_15=639/10, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L84] var_1_15 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L85] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=1, var_1_9=1073741824] [L99] RET updateVariables() [L100] CALL step() [L38] COND TRUE \read(var_1_2) [L39] var_1_8 = ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-10, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L43] COND TRUE \read(var_1_2) [L44] var_1_10 = (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L46] unsigned char stepLocal_1 = var_1_2; [L47] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, stepLocal_1=-255, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L48] COND TRUE stepLocal_1 || ((~ var_1_10) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-1706518424, var_1_10=-1706518424, var_1_11=163/5, var_1_1=-128, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L49] COND FALSE !(stepLocal_0 < var_1_8) [L54] var_1_1 = 2 VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_11=163/5, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L59] COND TRUE var_1_1 >= var_1_1 [L60] var_1_11 = (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((var_1_2 || ((~ var_1_10) >= var_1_10)) ? ((var_1_10 < var_1_8) ? ((! var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : 1) : (var_1_1 == ((signed char) 2))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_2 ? (var_1_8 == ((unsigned long int) ((1514707036u + ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) - last_1_var_1_10))) : (var_1_8 == ((unsigned long int) ((((last_1_var_1_10) > (var_1_9)) ? (last_1_var_1_10) : (var_1_9))))))) && (var_1_2 ? (var_1_10 == ((signed long int) (var_1_8 + ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) : 1)) && ((var_1_1 >= var_1_1) ? (var_1_11 == ((double) (var_1_12 - (((((var_1_13 + var_1_14)) > (var_1_15)) ? ((var_1_13 + var_1_14)) : (var_1_15)))))) : (var_1_11 == ((double) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-10, var_1_10=-1706518424, var_1_1=2, var_1_2=-255, var_1_6=1, var_1_7=2, var_1_8=2588448870, var_1_9=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 186 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1034/1056 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-19 00:21:09,978 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-15.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 f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:21:12,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:21:12,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:21:12,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:21:12,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:21:12,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:21:12,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:21:12,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:21:12,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:21:12,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:21:12,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:21:12,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:21:12,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:21:12,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:21:12,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:21:12,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:21:12,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:21:12,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:21:12,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:21:12,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:21:12,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:21:12,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:21:12,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:21:12,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:21:12,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:21:12,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:21:12,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:21:12,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:21:12,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:21:12,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:21:12,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:21:12,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:21:12,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:21:12,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:21:12,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:12,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:21:12,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:21:12,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:21:12,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:21:12,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:21:12,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:21:12,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:21:12,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:21:12,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:21:12,450 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 -> f973169401bb1753394cb63d2104eadaf253c35457ff559a70aef9da15f26905 [2024-11-19 00:21:12,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:21:12,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:21:12,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:21:12,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:21:12,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:21:12,858 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-15.i [2024-11-19 00:21:14,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:21:14,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:21:14,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-15.i [2024-11-19 00:21:14,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e3a8efc/bfd35784579e488dbf78cbd31ff706e9/FLAG7198b3ef6 [2024-11-19 00:21:14,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e3a8efc/bfd35784579e488dbf78cbd31ff706e9 [2024-11-19 00:21:14,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:21:14,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:21:14,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:14,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:21:14,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:21:14,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:14" (1/1) ... [2024-11-19 00:21:14,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf799e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:14, skipping insertion in model container [2024-11-19 00:21:14,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:14" (1/1) ... [2024-11-19 00:21:14,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:21:14,845 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-15.i[913,926] [2024-11-19 00:21:14,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:14,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:21:14,947 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-15.i[913,926] [2024-11-19 00:21:14,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:15,006 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:21:15,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15 WrapperNode [2024-11-19 00:21:15,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:15,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:15,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:21:15,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:21:15,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,067 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-19 00:21:15,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:15,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:21:15,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:21:15,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:21:15,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,105 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-19 00:21:15,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:21:15,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:21:15,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:21:15,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:21:15,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (1/1) ... [2024-11-19 00:21:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:21:15,182 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-19 00:21:15,188 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-19 00:21:15,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:21:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:21:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:21:15,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:21:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:21:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:21:15,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:21:15,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:21:17,729 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 00:21:17,730 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:21:17,742 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:21:17,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:21:17,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:17 BoogieIcfgContainer [2024-11-19 00:21:17,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:21:17,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:21:17,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:21:17,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:21:17,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:21:14" (1/3) ... [2024-11-19 00:21:17,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ee98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:17, skipping insertion in model container [2024-11-19 00:21:17,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:15" (2/3) ... [2024-11-19 00:21:17,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ee98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:17, skipping insertion in model container [2024-11-19 00:21:17,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:17" (3/3) ... [2024-11-19 00:21:17,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-15.i [2024-11-19 00:21:17,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:21:17,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:21:17,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:21:17,839 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;@1944ac5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:21:17,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:21:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 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-19 00:21:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:17,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:17,859 INFO L215 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-19 00:21:17,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1601258831, now seen corresponding path program 1 times [2024-11-19 00:21:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421355921] [2024-11-19 00:21:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:17,883 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-19 00:21:17,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:17,887 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-19 00:21:17,888 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-19 00:21:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:18,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:21:18,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-19 00:21:18,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:18,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421355921] [2024-11-19 00:21:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421355921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:21:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732271443] [2024-11-19 00:21:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:21:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:21:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:21:18,331 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-19 00:21:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:18,360 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions. [2024-11-19 00:21:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:21:18,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 82 [2024-11-19 00:21:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:18,373 INFO L225 Difference]: With dead ends: 85 [2024-11-19 00:21:18,374 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 00:21:18,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-19 00:21:18,384 INFO L432 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-19 00:21:18,385 INFO L433 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-19 00:21:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 00:21:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 00:21:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-19 00:21:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-19 00:21:18,435 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-19 00:21:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:18,436 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-19 00:21:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-19 00:21:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-19 00:21:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:18,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:18,441 INFO L215 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-19 00:21:18,454 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-19 00:21:18,645 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-19 00:21:18,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash 109782457, now seen corresponding path program 1 times [2024-11-19 00:21:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917565923] [2024-11-19 00:21:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:18,652 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-19 00:21:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:18,655 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-19 00:21:18,658 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-19 00:21:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:18,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:21:18,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-19 00:21:19,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:21:19,444 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-19 00:21:19,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917565923] [2024-11-19 00:21:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917565923] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:21:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:21:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-19 00:21:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82680688] [2024-11-19 00:21:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:19,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:21:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:21:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:21:19,450 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-19 00:21:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:20,116 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2024-11-19 00:21:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:21:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 82 [2024-11-19 00:21:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:20,130 INFO L225 Difference]: With dead ends: 95 [2024-11-19 00:21:20,130 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 00:21:20,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:21:20,132 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:20,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:21:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 00:21:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-19 00:21:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-19 00:21:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-19 00:21:20,150 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 82 [2024-11-19 00:21:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-19 00:21:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-19 00:21:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-19 00:21:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 00:21:20,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:20,158 INFO L215 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-19 00:21:20,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:21:20,358 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-19 00:21:20,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:20,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash -19505799, now seen corresponding path program 1 times [2024-11-19 00:21:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300773159] [2024-11-19 00:21:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:20,361 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-19 00:21:20,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:20,365 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-19 00:21:20,366 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-19 00:21:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:20,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:21:20,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:20,925 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-19 00:21:20,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:20,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300773159] [2024-11-19 00:21:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300773159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:21:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858364892] [2024-11-19 00:21:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:21:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:21:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:21:20,928 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-19 00:21:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:21,302 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-19 00:21:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:21:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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 82 [2024-11-19 00:21:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:21,305 INFO L225 Difference]: With dead ends: 127 [2024-11-19 00:21:21,305 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 00:21:21,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-19 00:21:21,307 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:21,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:21:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 00:21:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-19 00:21:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:21:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-19 00:21:21,334 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 82 [2024-11-19 00:21:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:21,335 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-19 00:21:21,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-19 00:21:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-19 00:21:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 00:21:21,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:21,337 INFO L215 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, 1] [2024-11-19 00:21:21,348 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 (4)] Ended with exit code 0 [2024-11-19 00:21:21,537 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-19 00:21:21,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -636021362, now seen corresponding path program 1 times [2024-11-19 00:21:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375201865] [2024-11-19 00:21:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:21,539 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-19 00:21:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:21,543 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-19 00:21:21,545 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-19 00:21:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:21,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:21:21,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:34,060 WARN L286 SmtUtils]: Spent 29.07s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)