./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.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 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:36:50,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:36:50,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:36:50,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:36:50,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:36:50,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:36:50,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:36:50,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:36:50,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:36:50,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:36:50,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:36:50,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:36:50,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:36:50,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:36:50,543 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:36:50,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:36:50,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:36:50,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:36:50,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:36:50,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:36:50,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:36:50,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:36:50,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:36:50,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:36:50,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:36:50,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:36:50,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:36:50,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:36:50,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:36:50,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:36:50,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:36:50,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:36:50,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:50,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:36:50,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:36:50,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:36:50,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:36:50,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:36:50,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:36:50,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:36:50,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:36:50,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:36:50,558 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 -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-10-14 11:36:50,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:36:50,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:36:50,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:36:50,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:36:50,819 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:36:50,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:36:52,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:36:52,491 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:36:52,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:36:52,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3b6f972/491d2cbb941f466d85bd9ee9a68e5185/FLAG231301cc1 [2024-10-14 11:36:52,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3b6f972/491d2cbb941f466d85bd9ee9a68e5185 [2024-10-14 11:36:52,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:36:52,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:36:52,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:52,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:36:52,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:36:52,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7e2143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52, skipping insertion in model container [2024-10-14 11:36:52,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:36:52,701 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i[915,928] [2024-10-14 11:36:52,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:52,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:36:52,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i[915,928] [2024-10-14 11:36:52,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:52,857 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:36:52,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52 WrapperNode [2024-10-14 11:36:52,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:52,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:52,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:36:52,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:36:52,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,909 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-14 11:36:52,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:36:52,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:36:52,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:36:52,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:36:52,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:36:52,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:36:52,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:36:52,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:36:52,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:36:52,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (1/1) ... [2024-10-14 11:36:52,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:36:53,007 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-10-14 11:36:53,013 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-10-14 11:36:53,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:36:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:36:53,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:36:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:36:53,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:36:53,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:36:53,155 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:36:53,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:36:53,387 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-14 11:36:53,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:36:53,420 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:36:53,420 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:36:53,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:53 BoogieIcfgContainer [2024-10-14 11:36:53,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:36:53,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:36:53,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:36:53,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:36:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:36:52" (1/3) ... [2024-10-14 11:36:53,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26896f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:53, skipping insertion in model container [2024-10-14 11:36:53,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:52" (2/3) ... [2024-10-14 11:36:53,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26896f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:36:53, skipping insertion in model container [2024-10-14 11:36:53,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:53" (3/3) ... [2024-10-14 11:36:53,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:36:53,451 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:36:53,452 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:36:53,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:36:53,527 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;@2d325ec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:36:53,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:36:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:36:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 11:36:53,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:53,541 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:36:53,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 740348185, now seen corresponding path program 1 times [2024-10-14 11:36:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:36:53,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93561788] [2024-10-14 11:36:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:36:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:36:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:36:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:36:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:36:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:36:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:36:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:36:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:36:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 11:36:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:36:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 11:36:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 11:36:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 11:36:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 11:36:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 11:36:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:36:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:36:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:36:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 11:36:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:36:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93561788] [2024-10-14 11:36:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93561788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:36:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:36:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:36:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073438058] [2024-10-14 11:36:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:36:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:36:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:36:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:36:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:36:53,928 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:36:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:36:53,969 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2024-10-14 11:36:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:36:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2024-10-14 11:36:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:36:53,983 INFO L225 Difference]: With dead ends: 89 [2024-10-14 11:36:53,984 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 11:36:53,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:36:53,994 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:36:53,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:36:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 11:36:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 11:36:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:36:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-14 11:36:54,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 102 [2024-10-14 11:36:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:36:54,074 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-14 11:36:54,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:36:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-14 11:36:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 11:36:54,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:36:54,096 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:36:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:36:54,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:36:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:36:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1308779817, now seen corresponding path program 1 times [2024-10-14 11:36:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:36:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569600270] [2024-10-14 11:36:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:36:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:36:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609236673] [2024-10-14 11:36:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:36:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:36:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:36:54,289 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-10-14 11:36:54,291 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-10-14 11:36:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:36:54,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:36:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:36:54,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:36:54,643 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:36:54,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:36:54,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:36:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:36:54,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 11:36:54,939 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:36:54,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:36:54 BoogieIcfgContainer [2024-10-14 11:36:54,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:36:54,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:36:54,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:36:54,944 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:36:54,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:36:53" (3/4) ... [2024-10-14 11:36:54,946 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:36:54,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:36:54,948 INFO L158 Benchmark]: Toolchain (without parser) took 2431.09ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 61.0MB in the beginning and 132.6MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:54,950 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 94.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:54,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.94ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 60.9MB in the beginning and 170.3MB in the end (delta: -109.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-14 11:36:54,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.43ms. Allocated memory is still 201.3MB. Free memory was 170.3MB in the beginning and 167.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:36:54,954 INFO L158 Benchmark]: Boogie Preprocessor took 55.96ms. Allocated memory is still 201.3MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:36:54,954 INFO L158 Benchmark]: RCFGBuilder took 453.83ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 147.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 11:36:54,954 INFO L158 Benchmark]: TraceAbstraction took 1519.52ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 132.6MB in the end (delta: 13.7MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-14 11:36:54,955 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 201.3MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:36:54,960 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.17ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 94.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.94ms. Allocated memory was 134.2MB in the beginning and 201.3MB in the end (delta: 67.1MB). Free memory was 60.9MB in the beginning and 170.3MB in the end (delta: -109.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.43ms. Allocated memory is still 201.3MB. Free memory was 170.3MB in the beginning and 167.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.96ms. Allocated memory is still 201.3MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.83ms. Allocated memory is still 201.3MB. Free memory was 165.1MB in the beginning and 147.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1519.52ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 132.6MB in the end (delta: 13.7MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 201.3MB. Free memory is still 132.6MB. 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, overapproximation of someBinaryArithmeticFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 25; [L27] unsigned short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 1; [L29] signed char var_1_12 = 1; [L30] float var_1_13 = 127.75; [L31] float var_1_14 = 0.0; [L32] float var_1_15 = 255.7; [L33] float var_1_16 = 7.6; [L34] unsigned long int var_1_17 = 64; [L35] signed long int var_1_18 = 0; [L102] isInitial = 1 [L103] FCALL initially() [L104] int k_loop; [L105] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L105] COND TRUE k_loop < 1 [L106] FCALL updateLastVariables() [L107] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=16, var_1_7=25, var_1_8=5, var_1_9=1] [L74] var_1_6 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=25, var_1_8=5, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=5, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=1] [L81] var_1_9 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L82] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L83] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L83] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1] [L84] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L84] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_12=1, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L85] var_1_12 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L86] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L87] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L87] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_14=0, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L88] var_1_14 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L89] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_15=2557/10, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L91] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_16=38/5, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L93] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=-127, var_1_13=511/4, var_1_17=64, var_1_18=0, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L107] RET updateVariables() [L108] CALL step() [L39] var_1_13 = ((var_1_14 - var_1_15) - var_1_16) [L40] var_1_17 = var_1_6 [L41] var_1_18 = var_1_9 [L42] unsigned short int stepLocal_3 = var_1_9; [L43] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, stepLocal_2=2, stepLocal_3=2, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=25, var_1_8=1, var_1_9=2] [L44] COND FALSE !(stepLocal_2 <= ((var_1_17 / var_1_8) / var_1_9)) [L51] var_1_7 = var_1_12 VAL [isInitial=1, stepLocal_3=2, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=-127, var_1_8=1, var_1_9=2] [L53] signed char stepLocal_1 = var_1_7; [L54] unsigned char stepLocal_0 = var_1_7 >= var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=2, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=-127, var_1_8=1, var_1_9=2] [L55] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-127, stepLocal_3=2, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=-127, var_1_8=1, var_1_9=2] [L108] RET step() [L109] CALL, EXPR property() [L98-L99] return ((((var_1_2 ? (((var_1_7 >= var_1_7) && var_1_5) ? ((var_1_7 >= var_1_7) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) var_1_6))) : 1) : (var_1_1 == ((unsigned short int) var_1_6))) && ((var_1_17 <= ((var_1_17 / var_1_8) / var_1_9)) ? ((var_1_9 == (var_1_18 * (~ var_1_18))) ? (var_1_7 == ((signed char) var_1_12)) : (var_1_7 == ((signed char) var_1_12))) : (var_1_7 == ((signed char) var_1_12)))) && (var_1_13 == ((float) ((var_1_14 - var_1_15) - var_1_16)))) && (var_1_17 == ((unsigned long int) var_1_6))) && (var_1_18 == ((signed long int) var_1_9)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=-127, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_12=-127, var_1_17=2, var_1_18=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=-127, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 61 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:36:54,994 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.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 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:36:57,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:36:57,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:36:57,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:36:57,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:36:57,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:36:57,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:36:57,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:36:57,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:36:57,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:36:57,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:36:57,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:36:57,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:36:57,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:36:57,301 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:36:57,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:36:57,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:36:57,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:36:57,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:36:57,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:36:57,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:36:57,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:36:57,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:36:57,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:36:57,308 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:36:57,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:36:57,308 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:36:57,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:36:57,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:36:57,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:36:57,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:36:57,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:36:57,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:36:57,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:36:57,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:36:57,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:36:57,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:36:57,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:36:57,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:36:57,312 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:36:57,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:36:57,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:36:57,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:36:57,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:36:57,314 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:36:57,314 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 -> 4d6f9f8754fd5e74a79795681184ddd0bb5014968bab7230012cd8a3c9285d31 [2024-10-14 11:36:57,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:36:57,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:36:57,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:36:57,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:36:57,673 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:36:57,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:36:59,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:36:59,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:36:59,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:36:59,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7116c27ec/eef944833c6c4d63b71c9eddc227ea7a/FLAG3f0117084 [2024-10-14 11:36:59,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7116c27ec/eef944833c6c4d63b71c9eddc227ea7a [2024-10-14 11:36:59,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:36:59,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:36:59,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:36:59,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:36:59,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:36:59,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:59" (1/1) ... [2024-10-14 11:36:59,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3cccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:36:59, skipping insertion in model container [2024-10-14 11:36:59,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:36:59" (1/1) ... [2024-10-14 11:36:59,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:36:59,853 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i[915,928] [2024-10-14 11:36:59,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:36:59,943 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:36:59,956 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-55.i[915,928] [2024-10-14 11:36:59,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:00,004 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:37:00,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00 WrapperNode [2024-10-14 11:37:00,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:00,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:00,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:37:00,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:37:00,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,056 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-14 11:37:00,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:00,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:37:00,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:37:00,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:37:00,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,100 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:37:00,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:37:00,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:37:00,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:37:00,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:37:00,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (1/1) ... [2024-10-14 11:37:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:37:00,159 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-10-14 11:37:00,165 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-10-14 11:37:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:37:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:37:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:37:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:37:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:37:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:37:00,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:37:00,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:37:00,739 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-14 11:37:00,740 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:37:00,783 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:37:00,783 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:37:00,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:00 BoogieIcfgContainer [2024-10-14 11:37:00,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:37:00,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:37:00,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:37:00,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:37:00,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:36:59" (1/3) ... [2024-10-14 11:37:00,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bc351d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:00, skipping insertion in model container [2024-10-14 11:37:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:00" (2/3) ... [2024-10-14 11:37:00,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bc351d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:00, skipping insertion in model container [2024-10-14 11:37:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:00" (3/3) ... [2024-10-14 11:37:00,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-55.i [2024-10-14 11:37:00,815 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:37:00,816 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:37:00,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:37:00,895 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;@3b6a1d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:37:00,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:37:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:37:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 11:37:00,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:00,915 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:37:00,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:00,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 740348185, now seen corresponding path program 1 times [2024-10-14 11:37:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:37:00,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757607526] [2024-10-14 11:37:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:00,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:37:00,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:37:00,951 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-10-14 11:37:00,953 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-10-14 11:37:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:01,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:37:01,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:37:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-14 11:37:01,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:37:01,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:37:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757607526] [2024-10-14 11:37:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757607526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:37:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902636198] [2024-10-14 11:37:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:37:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:37:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:37:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:37:01,333 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:37:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:01,569 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2024-10-14 11:37:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:37:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2024-10-14 11:37:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:01,578 INFO L225 Difference]: With dead ends: 89 [2024-10-14 11:37:01,579 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 11:37:01,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:37:01,586 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:01,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:37:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 11:37:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 11:37:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 11:37:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-14 11:37:01,646 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 102 [2024-10-14 11:37:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-14 11:37:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 11:37:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-14 11:37:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 11:37:01,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:01,655 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:37:01,669 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-10-14 11:37:01,856 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-10-14 11:37:01,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:01,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1308779817, now seen corresponding path program 1 times [2024-10-14 11:37:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:37:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036368941] [2024-10-14 11:37:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:01,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:37:01,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:37:01,863 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-10-14 11:37:01,864 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-10-14 11:37:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:02,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 11:37:02,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:37:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 11:37:38,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:37:38,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:37:38,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036368941] [2024-10-14 11:37:38,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036368941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:38,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:38,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 11:37:38,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376406896] [2024-10-14 11:37:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:38,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 11:37:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:37:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 11:37:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 11:37:38,037 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 11:38:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:13,261 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-10-14 11:38:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 11:38:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 102 [2024-10-14 11:38:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:13,264 INFO L225 Difference]: With dead ends: 92 [2024-10-14 11:38:13,264 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 11:38:13,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2024-10-14 11:38:13,266 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 74 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:13,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 233 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2024-10-14 11:38:13,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 11:38:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2024-10-14 11:38:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 11:38:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2024-10-14 11:38:13,289 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 102 [2024-10-14 11:38:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2024-10-14 11:38:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 11:38:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2024-10-14 11:38:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 11:38:13,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:13,292 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:38:13,303 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-10-14 11:38:13,493 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-10-14 11:38:13,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1932540969, now seen corresponding path program 1 times [2024-10-14 11:38:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:38:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471209809] [2024-10-14 11:38:13,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:38:13,499 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-10-14 11:38:13,500 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-10-14 11:38:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:13,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 11:38:13,833 INFO L278 TraceCheckSpWp]: Computing forward predicates...