./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.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-23.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 d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:21,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:21,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:22:21,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:21,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:21,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:21,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:21,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:21,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:21,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:21,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:21,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:21,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:21,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:21,189 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:21,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:21,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:21,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:21,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:21,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:21,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:21,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:21,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:21,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:21,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:21,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:21,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:21,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:21,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:21,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:21,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:21,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:22:21,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:22:21,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:21,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:21,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:21,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:21,197 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 -> d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 [2024-11-19 00:22:21,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:21,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:21,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:21,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:21,466 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:21,467 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-23.i [2024-11-19 00:22:22,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:22,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:22,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.i [2024-11-19 00:22:22,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0306f961c/83e704e4223f4b858c208c2b53ca6877/FLAGc863195bc [2024-11-19 00:22:23,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0306f961c/83e704e4223f4b858c208c2b53ca6877 [2024-11-19 00:22:23,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:23,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:23,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:23,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:23,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:23,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5661d469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23, skipping insertion in model container [2024-11-19 00:22:23,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:23,455 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-23.i[913,926] [2024-11-19 00:22:23,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:23,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:23,510 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-23.i[913,926] [2024-11-19 00:22:23,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:23,538 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:23,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23 WrapperNode [2024-11-19 00:22:23,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:23,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:23,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:23,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:23,546 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:22:23" (1/1) ... [2024-11-19 00:22:23,551 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:22:23" (1/1) ... [2024-11-19 00:22:23,572 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-19 00:22:23,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:23,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:23,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:23,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:23,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,598 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:22:23,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:23,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:23,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:23,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:23,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (1/1) ... [2024-11-19 00:22:23,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:23,649 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:22:23,654 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:22:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:23,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:22:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:23,797 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:23,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:24,015 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:24,016 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:24,030 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:24,030 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:24,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:24 BoogieIcfgContainer [2024-11-19 00:22:24,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:24,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:24,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:24,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:24,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:23" (1/3) ... [2024-11-19 00:22:24,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600c7e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:24, skipping insertion in model container [2024-11-19 00:22:24,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:23" (2/3) ... [2024-11-19 00:22:24,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600c7e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:24, skipping insertion in model container [2024-11-19 00:22:24,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:24" (3/3) ... [2024-11-19 00:22:24,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-23.i [2024-11-19 00:22:24,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:24,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:24,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:24,108 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;@7d021923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:24,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:24,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:24,121 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:24,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1570848541, now seen corresponding path program 1 times [2024-11-19 00:22:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165269643] [2024-11-19 00:22:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:22:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165269643] [2024-11-19 00:22:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165269643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:22:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535414480] [2024-11-19 00:22:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:24,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:24,403 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:22:24,404 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:22:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:24,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:24,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 00:22:24,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535414480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:24,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:22:24,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:22:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656228324] [2024-11-19 00:22:24,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:24,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:24,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:24,579 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:22:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:24,606 INFO L93 Difference]: Finished difference Result 107 states and 182 transitions. [2024-11-19 00:22:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:24,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-19 00:22:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:24,623 INFO L225 Difference]: With dead ends: 107 [2024-11-19 00:22:24,624 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 00:22:24,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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:22:24,630 INFO L432 NwaCegarLoop]: 77 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, 77 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:22:24,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 00:22:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 00:22:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-19 00:22:24,674 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2024-11-19 00:22:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-19 00:22:24,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:22:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-19 00:22:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:24,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:24,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:24,691 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:22:24,879 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:22:24,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1680222887, now seen corresponding path program 1 times [2024-11-19 00:22:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727730892] [2024-11-19 00:22:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:22:25,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:25,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727730892] [2024-11-19 00:22:25,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727730892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:22:25,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759248816] [2024-11-19 00:22:25,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:22:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:22:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:22:25,562 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:22:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:25,919 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2024-11-19 00:22:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:22:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-19 00:22:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:25,923 INFO L225 Difference]: With dead ends: 157 [2024-11-19 00:22:25,923 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 00:22:25,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:22:25,926 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 98 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:25,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 212 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:22:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 00:22:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 60. [2024-11-19 00:22:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2024-11-19 00:22:25,943 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2024-11-19 00:22:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:25,944 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2024-11-19 00:22:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:22:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2024-11-19 00:22:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:25,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:25,948 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:25,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:22:25,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:25,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1737481189, now seen corresponding path program 1 times [2024-11-19 00:22:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990825782] [2024-11-19 00:22:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:22:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376101858] [2024-11-19 00:22:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:26,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:26,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:26,038 INFO L229 MonitoredProcess]: Starting monitored process 3 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:22:26,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:22:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:26,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:22:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:26,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:22:26,242 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:22:26,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:22:26,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:22:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:22:26,454 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:22:26,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:22:26,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:22:26 BoogieIcfgContainer [2024-11-19 00:22:26,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:22:26,533 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:22:26,533 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:22:26,533 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:22:26,534 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:24" (3/4) ... [2024-11-19 00:22:26,537 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:22:26,538 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:22:26,539 INFO L158 Benchmark]: Toolchain (without parser) took 3248.17ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 99.8MB in the beginning and 121.3MB in the end (delta: -21.5MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,539 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:26,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.94ms. Allocated memory is still 138.4MB. Free memory was 99.8MB in the beginning and 85.4MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 138.4MB. Free memory was 85.4MB in the beginning and 83.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,541 INFO L158 Benchmark]: Boogie Preprocessor took 38.45ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 80.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,541 INFO L158 Benchmark]: RCFGBuilder took 418.62ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 96.9MB in the end (delta: -16.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,542 INFO L158 Benchmark]: TraceAbstraction took 2500.66ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 96.4MB in the beginning and 122.4MB in the end (delta: -26.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-19 00:22:26,545 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 174.1MB. Free memory was 122.4MB in the beginning and 121.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:26,546 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.16ms. Allocated memory is still 138.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.94ms. Allocated memory is still 138.4MB. Free memory was 99.8MB in the beginning and 85.4MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 138.4MB. Free memory was 85.4MB in the beginning and 83.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.45ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 80.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.62ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 96.9MB in the end (delta: -16.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2500.66ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 96.4MB in the beginning and 122.4MB in the end (delta: -26.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 174.1MB. Free memory was 122.4MB in the beginning and 121.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int var_1_2 = 16; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 25; [L26] float var_1_5 = 1.2; [L27] float var_1_6 = 999.7; [L28] float var_1_7 = 1.4; [L29] float var_1_8 = 9.75; [L30] float var_1_9 = 1.75; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 1277342739; [L33] unsigned long int var_1_12 = 1394088949; [L34] unsigned long int var_1_13 = 0; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_17 = 0; [L37] unsigned char var_1_18 = 0; [L38] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=16, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=64, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L65] var_1_3 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_5=6/5, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L68] var_1_5 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L69] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_6=9997/10, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L70] var_1_6 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L72] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_7=7/5, var_1_8=39/4, var_1_9=7/4] [L73] var_1_7 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L74] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_8=39/4, var_1_9=7/4] [L75] var_1_8 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L76] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25, var_1_9=7/4] [L77] var_1_9 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L78] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=1277342739, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L79] var_1_11 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L80] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L81] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=1394088949, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L82] var_1_12 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L83] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L85] var_1_13 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L87] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L88] var_1_17 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L89] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L90] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L91] var_1_19 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L93] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L106] RET updateVariables() [L107] CALL step() [L42] var_1_1 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=25] [L43] COND TRUE (var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9)) [L44] var_1_4 = ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, var_1_10=16, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L46] var_1_10 = ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13)))) [L47] unsigned char stepLocal_0 = (- var_1_5) != 1.9f; VAL [isInitial=1, stepLocal_0=0, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L48] COND FALSE !(stepLocal_0 || ((var_1_4 * var_1_13) < var_1_3)) [L51] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L53] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_1 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) && (((var_1_5 / var_1_6) <= (var_1_7 + (var_1_8 - var_1_9))) ? (var_1_4 == ((unsigned long int) ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1)) && (var_1_10 == ((unsigned long int) ((((var_1_2) > (((var_1_11 + var_1_12) - var_1_13))) ? (var_1_2) : (((var_1_11 + var_1_12) - var_1_13))))))) && (var_1_18 ? ((! ((var_1_5 / var_1_6) < (var_1_8 - var_1_9))) ? (var_1_18 ? (var_1_14 == ((unsigned char) (! var_1_17))) : 1) : 1) : 1)) && ((((- var_1_5) != 1.9f) || ((var_1_4 * var_1_13) < var_1_3)) ? (var_1_18 == ((unsigned char) (! var_1_19))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483647, var_1_11=-3221225473, var_1_12=5368709120, var_1_13=0, var_1_14=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 164 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2242/2280 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:22:26,568 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-23.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 d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:28,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:28,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:22:28,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:28,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:28,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:28,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:28,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:28,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:28,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:28,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:28,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:28,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:28,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:28,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:28,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:28,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:28,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:28,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:28,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:28,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:22:28,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:28,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:28,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:28,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:28,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:28,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:28,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:28,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:22:28,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:28,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:28,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:28,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:28,553 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 -> d9a4a26779ee984e42e9384b39e93bedd4033278a9c1a1ebdac0e82301018e49 [2024-11-19 00:22:28,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:28,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:28,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:28,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:28,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:28,822 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-23.i [2024-11-19 00:22:30,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:30,283 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:30,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-23.i [2024-11-19 00:22:30,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eee17008/c25e7fc79a804c95af307ecd37bf2406/FLAG4e90303d7 [2024-11-19 00:22:30,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eee17008/c25e7fc79a804c95af307ecd37bf2406 [2024-11-19 00:22:30,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:30,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:30,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:30,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:30,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:30,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:30,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794f98f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30, skipping insertion in model container [2024-11-19 00:22:30,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:30,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:30,856 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-23.i[913,926] [2024-11-19 00:22:30,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:30,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:30,933 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-23.i[913,926] [2024-11-19 00:22:30,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:30,977 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:30,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30 WrapperNode [2024-11-19 00:22:30,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:30,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:30,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:30,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:30,984 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:22:30" (1/1) ... [2024-11-19 00:22:30,999 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:22:30" (1/1) ... [2024-11-19 00:22:31,025 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-19 00:22:31,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:31,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:31,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:31,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:31,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,059 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:22:31,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:31,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:31,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:31,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:31,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (1/1) ... [2024-11-19 00:22:31,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:31,119 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:22:31,122 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:22:31,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:31,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:22:31,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:31,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:31,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:31,239 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:31,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:40,369 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:40,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:40,380 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:40,380 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:40,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:40 BoogieIcfgContainer [2024-11-19 00:22:40,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:40,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:40,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:40,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:40,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:30" (1/3) ... [2024-11-19 00:22:40,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203dd302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:40, skipping insertion in model container [2024-11-19 00:22:40,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:30" (2/3) ... [2024-11-19 00:22:40,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203dd302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:40, skipping insertion in model container [2024-11-19 00:22:40,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:40" (3/3) ... [2024-11-19 00:22:40,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-23.i [2024-11-19 00:22:40,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:40,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:40,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:40,464 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;@693cfb6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:40,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:40,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:40,480 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:40,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:40,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1570848541, now seen corresponding path program 1 times [2024-11-19 00:22:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236056594] [2024-11-19 00:22:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:40,499 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:22:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:40,503 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:22:40,505 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:22:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:40,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:40,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-19 00:22:40,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:40,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:40,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236056594] [2024-11-19 00:22:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236056594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:40,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:22:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158777426] [2024-11-19 00:22:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:40,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:40,974 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:22:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:40,996 INFO L93 Difference]: Finished difference Result 107 states and 182 transitions. [2024-11-19 00:22:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:40,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-19 00:22:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:41,004 INFO L225 Difference]: With dead ends: 107 [2024-11-19 00:22:41,004 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 00:22:41,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:22:41,009 INFO L432 NwaCegarLoop]: 77 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, 77 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:22:41,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 00:22:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 00:22:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-19 00:22:41,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 125 [2024-11-19 00:22:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-19 00:22:41,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 00:22:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-19 00:22:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:41,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:41,056 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:41,068 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:22:41,257 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:22:41,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1680222887, now seen corresponding path program 1 times [2024-11-19 00:22:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:41,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251529211] [2024-11-19 00:22:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:41,259 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:22:41,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:41,262 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:22:41,263 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:22:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:41,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:22:41,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-19 00:22:41,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:41,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251529211] [2024-11-19 00:22:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251529211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:41,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:41,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:22:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236175588] [2024-11-19 00:22:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:41,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:22:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:22:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:22:41,899 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:22:44,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:47,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:22:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:47,969 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2024-11-19 00:22:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:22:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-19 00:22:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:47,973 INFO L225 Difference]: With dead ends: 169 [2024-11-19 00:22:47,973 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 00:22:47,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:22:47,975 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 97 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:47,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 246 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-19 00:22:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 00:22:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2024-11-19 00:22:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:22:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2024-11-19 00:22:47,991 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 125 [2024-11-19 00:22:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:47,993 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2024-11-19 00:22:47,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-19 00:22:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2024-11-19 00:22:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:22:47,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:47,996 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:48,010 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:22:48,197 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:22:48,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:48,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1737481189, now seen corresponding path program 1 times [2024-11-19 00:22:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983053552] [2024-11-19 00:22:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:48,200 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:22:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:48,203 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:22:48,205 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:22:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:48,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:22:48,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:49,626 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 00:23:56,428 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)