./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.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 61baff025ed1826778930d2297acbbb0c7636497384ff5cdb264bdd3e935514a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:55:02,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:55:02,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:55:02,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:55:02,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:55:03,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:55:03,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:55:03,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:55:03,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:55:03,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:55:03,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:55:03,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:55:03,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:55:03,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:55:03,012 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:55:03,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:55:03,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:55:03,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:55:03,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:55:03,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:55:03,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:55:03,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:55:03,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:55:03,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:55:03,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:55:03,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:55:03,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:55:03,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:55:03,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:55:03,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:55:03,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:55:03,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:55:03,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:55:03,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:55:03,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:55:03,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:55:03,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:55:03,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:55:03,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:55:03,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:55:03,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:55:03,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:55:03,024 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 -> 61baff025ed1826778930d2297acbbb0c7636497384ff5cdb264bdd3e935514a [2024-11-18 22:55:03,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:55:03,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:55:03,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:55:03,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:55:03,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:55:03,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:04,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:55:04,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:55:04,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:04,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69fd054e3/e7c16b277dce4ab496a296a6cb69e40f/FLAGb9341f686 [2024-11-18 22:55:04,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69fd054e3/e7c16b277dce4ab496a296a6cb69e40f [2024-11-18 22:55:04,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:55:04,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:55:04,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:55:04,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:55:04,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:55:04,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:55:04" (1/1) ... [2024-11-18 22:55:04,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4789ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:04, skipping insertion in model container [2024-11-18 22:55:04,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:55:04" (1/1) ... [2024-11-18 22:55:04,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:55:05,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i[915,928] [2024-11-18 22:55:05,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:55:05,098 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:55:05,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i[915,928] [2024-11-18 22:55:05,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:55:05,142 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:55:05,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05 WrapperNode [2024-11-18 22:55:05,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:55:05,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:55:05,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:55:05,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:55:05,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,180 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-18 22:55:05,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:55:05,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:55:05,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:55:05,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:55:05,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:55:05,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:55:05,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:55:05,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:55:05,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:55:05,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (1/1) ... [2024-11-18 22:55:05,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:55:05,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:55:05,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:55:05,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:55:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:55:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:55:05,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:55:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:55:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:55:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:55:05,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:55:05,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:55:05,520 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 22:55:05,521 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:55:05,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:55:05,533 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:55:05,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:55:05 BoogieIcfgContainer [2024-11-18 22:55:05,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:55:05,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:55:05,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:55:05,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:55:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:55:04" (1/3) ... [2024-11-18 22:55:05,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d68073b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:55:05, skipping insertion in model container [2024-11-18 22:55:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:05" (2/3) ... [2024-11-18 22:55:05,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d68073b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:55:05, skipping insertion in model container [2024-11-18 22:55:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:55:05" (3/3) ... [2024-11-18 22:55:05,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:05,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:55:05,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:55:05,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:55:05,611 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;@411b165d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:55:05,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:55:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:05,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:05,623 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:05,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash 202325603, now seen corresponding path program 1 times [2024-11-18 22:55:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:55:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278117679] [2024-11-18 22:55:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:55:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-18 22:55:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:55:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278117679] [2024-11-18 22:55:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278117679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:55:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537947406] [2024-11-18 22:55:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:55:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:55:05,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:55:05,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:55:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:05,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:55:05,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:55:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-18 22:55:05,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:55:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537947406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:55:05,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:55:05,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:55:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85970644] [2024-11-18 22:55:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:55:05,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:55:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:55:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:55:06,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:55:06,007 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 22:55:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:55:06,025 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2024-11-18 22:55:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:55:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-18 22:55:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:55:06,032 INFO L225 Difference]: With dead ends: 85 [2024-11-18 22:55:06,033 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 22:55:06,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:55:06,038 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:55:06,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:55:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 22:55:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-18 22:55:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-18 22:55:06,068 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-18 22:55:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:55:06,069 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-18 22:55:06,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 22:55:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-18 22:55:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:06,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:06,073 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:06,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 22:55:06,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:55:06,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:06,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1960831903, now seen corresponding path program 1 times [2024-11-18 22:55:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:55:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650307136] [2024-11-18 22:55:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:55:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 22:55:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:55:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650307136] [2024-11-18 22:55:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650307136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:55:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211535162] [2024-11-18 22:55:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:06,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:55:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:55:06,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:55:06,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 22:55:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:06,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:55:06,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:55:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-18 22:55:06,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:55:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 22:55:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211535162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:55:07,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:55:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-18 22:55:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480193544] [2024-11-18 22:55:07,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:55:07,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:55:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:55:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:55:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:55:07,067 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 22:55:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:55:07,255 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-11-18 22:55:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:55:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2024-11-18 22:55:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:55:07,257 INFO L225 Difference]: With dead ends: 89 [2024-11-18 22:55:07,257 INFO L226 Difference]: Without dead ends: 50 [2024-11-18 22:55:07,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:55:07,259 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:55:07,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 90 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:55:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-18 22:55:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-18 22:55:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-11-18 22:55:07,274 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2024-11-18 22:55:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:55:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-11-18 22:55:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 22:55:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-11-18 22:55:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:07,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:07,278 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:07,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 22:55:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-18 22:55:07,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:07,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:07,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1962678945, now seen corresponding path program 1 times [2024-11-18 22:55:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:55:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410488390] [2024-11-18 22:55:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:55:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:55:07,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:55:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:55:07,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:55:07,575 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:55:07,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:55:07,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:55:07,579 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 22:55:07,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:55:07,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:55:07 BoogieIcfgContainer [2024-11-18 22:55:07,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:55:07,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:55:07,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:55:07,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:55:07,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:55:05" (3/4) ... [2024-11-18 22:55:07,625 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:55:07,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:55:07,627 INFO L158 Benchmark]: Toolchain (without parser) took 2762.02ms. Allocated memory was 186.6MB in the beginning and 255.9MB in the end (delta: 69.2MB). Free memory was 113.6MB in the beginning and 108.4MB in the end (delta: 5.1MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,627 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:55:07,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.20ms. Allocated memory is still 186.6MB. Free memory was 113.4MB in the beginning and 99.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.30ms. Allocated memory is still 186.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,628 INFO L158 Benchmark]: Boogie Preprocessor took 66.03ms. Allocated memory is still 186.6MB. Free memory was 97.3MB in the beginning and 154.8MB in the end (delta: -57.5MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,628 INFO L158 Benchmark]: RCFGBuilder took 285.53ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 143.6MB in the end (delta: 11.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,628 INFO L158 Benchmark]: TraceAbstraction took 2087.18ms. Allocated memory was 186.6MB in the beginning and 255.9MB in the end (delta: 69.2MB). Free memory was 142.5MB in the beginning and 109.5MB in the end (delta: 33.1MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2024-11-18 22:55:07,628 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 255.9MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:55:07,630 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.18ms. Allocated memory is still 186.6MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.20ms. Allocated memory is still 186.6MB. Free memory was 113.4MB in the beginning and 99.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.30ms. Allocated memory is still 186.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.03ms. Allocated memory is still 186.6MB. Free memory was 97.3MB in the beginning and 154.8MB in the end (delta: -57.5MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * RCFGBuilder took 285.53ms. Allocated memory is still 186.6MB. Free memory was 154.7MB in the beginning and 143.6MB in the end (delta: 11.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2087.18ms. Allocated memory was 186.6MB in the beginning and 255.9MB in the end (delta: 69.2MB). Free memory was 142.5MB in the beginning and 109.5MB in the end (delta: 33.1MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 255.9MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticFLOAToperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_4 = 64.4; [L24] float var_1_5 = 0.2; [L25] double var_1_8 = 31.75; [L26] double var_1_9 = 50.375; [L27] double var_1_10 = 99.25; [L28] double var_1_11 = 16.4; [L29] double var_1_12 = 64.5; [L30] float var_1_13 = 8.75; [L31] float var_1_14 = 127.1; [L32] unsigned short int var_1_15 = 5; [L33] unsigned char var_1_18 = 0; [L34] unsigned char var_1_19 = 0; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 8; [L37] double last_1_var_1_8 = 31.75; VAL [isInitial=0, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_4=322/5, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L63] var_1_4 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L64] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_5=1/5, var_1_8=127/4, var_1_9=403/8] [L65] var_1_5 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L66] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4, var_1_9=403/8] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L68] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L69] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_10=397/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L70] var_1_10 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L71] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_11=82/5, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L72] var_1_11 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=129/2, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L74] var_1_12 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_14=1271/10, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L76] var_1_14 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L77] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L78] var_1_19 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L79] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L80] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=8, var_1_8=127/4] [L81] var_1_21 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L82] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_8=127/4] [L83] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L83] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=127/4] [L97] RET updateVariables() [L98] CALL step() [L41] COND FALSE !((- (var_1_5 / var_1_9)) != last_1_var_1_8) [L46] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_13=35/4, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=254, var_1_8=259] [L48] var_1_13 = (128.75f + var_1_14) [L49] var_1_18 = var_1_19 [L50] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=254, var_1_21=254, var_1_8=259] [L51] COND FALSE !(var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) [L56] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L58] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return ((((((var_1_13 != ((((var_1_13) > ((var_1_4 - var_1_5))) ? (var_1_13) : ((var_1_4 - var_1_5))))) ? (var_1_18 ? (var_1_1 == ((signed short int) var_1_20)) : 1) : (var_1_1 == ((signed short int) var_1_20))) && (((- (var_1_5 / var_1_9)) != last_1_var_1_8) ? ((var_1_4 != (- var_1_9)) ? (var_1_8 == ((double) ((var_1_10 + var_1_11) - var_1_12))) : 1) : (var_1_8 == ((double) var_1_12)))) && (var_1_13 == ((float) (128.75f + var_1_14)))) && (var_1_18 ? (var_1_15 == ((unsigned short int) (var_1_20 + var_1_20))) : 1)) && (var_1_18 == ((unsigned char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=127/4, var_1_12=259, var_1_15=5, var_1_18=0, var_1_19=0, var_1_1=254, var_1_20=254, var_1_21=254, var_1_8=259] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 97 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 579 SizeOfPredicates, 2 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1280/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:55:07,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.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 61baff025ed1826778930d2297acbbb0c7636497384ff5cdb264bdd3e935514a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:55:10,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:55:10,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:55:10,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:55:10,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:55:10,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:55:10,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:55:10,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:55:10,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:55:10,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:55:10,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:55:10,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:55:10,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:55:10,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:55:10,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:55:10,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:55:10,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:55:10,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:55:10,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:55:10,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:55:10,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:55:10,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:55:10,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:55:10,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:55:10,347 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:55:10,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:55:10,347 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:55:10,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:55:10,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:55:10,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:55:10,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:55:10,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:55:10,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:55:10,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:55:10,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:55:10,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:55:10,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:55:10,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:55:10,349 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:55:10,350 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:55:10,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:55:10,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:55:10,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:55:10,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:55:10,351 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 -> 61baff025ed1826778930d2297acbbb0c7636497384ff5cdb264bdd3e935514a [2024-11-18 22:55:10,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:55:10,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:55:10,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:55:10,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:55:10,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:55:10,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:12,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:55:12,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:55:12,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:12,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d8fbf10/330822783be6445a920b209dcb630f99/FLAGcaf3473c4 [2024-11-18 22:55:12,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d8fbf10/330822783be6445a920b209dcb630f99 [2024-11-18 22:55:12,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:55:12,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:55:12,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:55:12,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:55:12,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:55:12,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a985762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12, skipping insertion in model container [2024-11-18 22:55:12,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:55:12,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i[915,928] [2024-11-18 22:55:12,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:55:12,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:55:12,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-43.i[915,928] [2024-11-18 22:55:12,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:55:12,713 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:55:12,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12 WrapperNode [2024-11-18 22:55:12,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:55:12,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:55:12,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:55:12,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:55:12,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,761 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-18 22:55:12,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:55:12,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:55:12,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:55:12,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:55:12,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,792 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:55:12,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:55:12,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:55:12,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:55:12,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:55:12,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (1/1) ... [2024-11-18 22:55:12,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:55:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:55:12,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:55:12,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:55:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:55:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:55:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:55:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:55:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:55:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:55:12,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:55:12,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:55:27,106 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 22:55:27,106 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:55:27,117 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:55:27,117 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:55:27,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:55:27 BoogieIcfgContainer [2024-11-18 22:55:27,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:55:27,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:55:27,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:55:27,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:55:27,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:55:12" (1/3) ... [2024-11-18 22:55:27,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbb1e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:55:27, skipping insertion in model container [2024-11-18 22:55:27,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:55:12" (2/3) ... [2024-11-18 22:55:27,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbb1e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:55:27, skipping insertion in model container [2024-11-18 22:55:27,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:55:27" (3/3) ... [2024-11-18 22:55:27,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-43.i [2024-11-18 22:55:27,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:55:27,136 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:55:27,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:55:27,214 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;@5365bf53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:55:27,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:55:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:27,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:27,236 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:27,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:27,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash 202325603, now seen corresponding path program 1 times [2024-11-18 22:55:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:55:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747336805] [2024-11-18 22:55:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:27,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:55:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:55:27,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:55:27,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:55:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:28,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:55:28,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:55:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-18 22:55:28,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:55:28,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:55:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747336805] [2024-11-18 22:55:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747336805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:55:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:55:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:55:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342474190] [2024-11-18 22:55:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:55:28,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:55:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:55:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:55:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:55:28,302 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 22:55:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:55:28,320 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2024-11-18 22:55:28,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:55:28,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-18 22:55:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:55:28,331 INFO L225 Difference]: With dead ends: 85 [2024-11-18 22:55:28,331 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 22:55:28,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:55:28,336 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:55:28,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:55:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 22:55:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-18 22:55:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-18 22:55:28,366 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 82 [2024-11-18 22:55:28,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:55:28,366 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-18 22:55:28,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 22:55:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-18 22:55:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:28,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:28,369 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:28,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 22:55:28,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:55:28,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1960831903, now seen corresponding path program 1 times [2024-11-18 22:55:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:55:28,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475830753] [2024-11-18 22:55:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:55:28,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:55:28,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:55:28,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:55:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:29,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 22:55:29,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:55:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-18 22:55:30,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:55:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 22:55:33,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:55:33,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475830753] [2024-11-18 22:55:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475830753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:55:33,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:55:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-18 22:55:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767929834] [2024-11-18 22:55:33,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:55:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:55:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:55:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:55:33,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:55:33,256 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 22:55:40,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:55:44,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:55:48,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:55:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:55:48,493 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-11-18 22:55:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:55:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 82 [2024-11-18 22:55:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:55:48,644 INFO L225 Difference]: With dead ends: 89 [2024-11-18 22:55:48,645 INFO L226 Difference]: Without dead ends: 50 [2024-11-18 22:55:48,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:55:48,646 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:55:48,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 89 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2024-11-18 22:55:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-18 22:55:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-18 22:55:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:55:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-11-18 22:55:48,662 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 82 [2024-11-18 22:55:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:55:48,662 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-11-18 22:55:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 22:55:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-11-18 22:55:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-18 22:55:48,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:55:48,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:55:48,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:55:48,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:55:48,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:55:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:55:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1962678945, now seen corresponding path program 1 times [2024-11-18 22:55:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:55:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013589928] [2024-11-18 22:55:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:55:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:55:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:55:48,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:55:48,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 22:55:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:55:50,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 22:55:50,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:56:06,746 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 22:56:15,041 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 22:56:23,334 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 22:56:31,615 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 22:56:39,794 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 22:56:48,312 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)