./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:11:52,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:11:52,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:11:52,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:11:52,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:11:52,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:11:52,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:11:52,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:11:52,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:11:52,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:11:52,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:11:52,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:11:52,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:11:52,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:11:52,556 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:11:52,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:11:52,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:11:52,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:11:52,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:11:52,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:11:52,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:11:52,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:11:52,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:11:52,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:11:52,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:11:52,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:11:52,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:11:52,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:11:52,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:11:52,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:11:52,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:11:52,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:11:52,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:11:52,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:11:52,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:11:52,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:11:52,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:11:52,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:11:52,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:11:52,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:11:52,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:11:52,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:11:52,570 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2024-10-13 00:11:52,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:11:52,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:11:52,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:11:52,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:11:52,893 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:11:52,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-10-13 00:11:54,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:11:54,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:11:54,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-10-13 00:11:54,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f145d0798/03ae79b12a404d419329e2bb172a5c34/FLAGb9eb44212 [2024-10-13 00:11:55,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f145d0798/03ae79b12a404d419329e2bb172a5c34 [2024-10-13 00:11:55,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:11:55,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:11:55,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:11:55,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:11:55,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:11:55,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da5d55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55, skipping insertion in model container [2024-10-13 00:11:55,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:11:55,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2024-10-13 00:11:55,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:11:55,403 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:11:55,418 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2024-10-13 00:11:55,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:11:55,466 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:11:55,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55 WrapperNode [2024-10-13 00:11:55,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:11:55,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:11:55,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:11:55,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:11:55,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,526 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-10-13 00:11:55,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:11:55,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:11:55,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:11:55,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:11:55,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:11:55,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:11:55,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:11:55,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:11:55,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:11:55,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (1/1) ... [2024-10-13 00:11:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:11:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:11:55,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:11:55,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:11:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:11:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:11:55,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:11:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:11:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:11:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:11:55,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:11:55,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:11:56,200 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:11:56,200 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:11:56,238 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:11:56,238 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:11:56,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:56 BoogieIcfgContainer [2024-10-13 00:11:56,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:11:56,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:11:56,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:11:56,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:11:56,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:11:55" (1/3) ... [2024-10-13 00:11:56,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28439e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:56, skipping insertion in model container [2024-10-13 00:11:56,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:55" (2/3) ... [2024-10-13 00:11:56,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28439e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:56, skipping insertion in model container [2024-10-13 00:11:56,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:56" (3/3) ... [2024-10-13 00:11:56,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2024-10-13 00:11:56,269 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:11:56,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:11:56,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:11:56,344 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;@4fa5dcd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:11:56,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:11:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 45 states have (on average 1.511111111111111) internal successors, (68), 46 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 00:11:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 00:11:56,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:56,365 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:11:56,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:56,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 323636528, now seen corresponding path program 1 times [2024-10-13 00:11:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:56,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965036265] [2024-10-13 00:11:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:11:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:11:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:11:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:11:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:11:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:11:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:11:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:11:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:11:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:11:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:11:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:11:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:11:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:11:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:11:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:11:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:11:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:11:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 00:11:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:11:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965036265] [2024-10-13 00:11:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965036265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:11:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:11:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:11:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498222349] [2024-10-13 00:11:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:11:56,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:11:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:11:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:11:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:11:56,896 INFO L87 Difference]: Start difference. First operand has 66 states, 45 states have (on average 1.511111111111111) internal successors, (68), 46 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 00:11:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:56,941 INFO L93 Difference]: Finished difference Result 129 states and 224 transitions. [2024-10-13 00:11:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:11:56,946 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-10-13 00:11:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:56,957 INFO L225 Difference]: With dead ends: 129 [2024-10-13 00:11:56,958 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 00:11:56,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:11:56,967 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:56,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:11:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 00:11:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-13 00:11:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 00:11:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-10-13 00:11:57,030 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 118 [2024-10-13 00:11:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:57,033 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-10-13 00:11:57,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 00:11:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-10-13 00:11:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 00:11:57,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:57,042 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:11:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:11:57,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1120678692, now seen corresponding path program 1 times [2024-10-13 00:11:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853320017] [2024-10-13 00:11:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:11:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:11:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:11:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:11:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:11:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:11:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:11:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:11:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:11:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:11:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:11:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:11:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:11:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:11:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:11:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:11:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:11:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:11:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 00:11:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:11:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853320017] [2024-10-13 00:11:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853320017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:11:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370341134] [2024-10-13 00:11:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:57,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:11:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:11:58,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:11:58,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:11:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:11:58,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 00:11:58,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:11:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 00:11:58,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:11:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 00:11:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370341134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:11:58,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:11:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-13 00:11:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740207338] [2024-10-13 00:11:58,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:11:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 00:11:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:11:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 00:11:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:11:58,881 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 00:11:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:11:59,515 INFO L93 Difference]: Finished difference Result 186 states and 277 transitions. [2024-10-13 00:11:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 00:11:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 118 [2024-10-13 00:11:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:11:59,522 INFO L225 Difference]: With dead ends: 186 [2024-10-13 00:11:59,522 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 00:11:59,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2024-10-13 00:11:59,527 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 239 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:11:59,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 297 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:11:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 00:11:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2024-10-13 00:11:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 00:11:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-13 00:11:59,553 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 118 [2024-10-13 00:11:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:11:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-13 00:11:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 00:11:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-13 00:11:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 00:11:59,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:11:59,557 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:11:59,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:11:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:11:59,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:11:59,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:11:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1563618403, now seen corresponding path program 1 times [2024-10-13 00:11:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:11:59,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508639673] [2024-10-13 00:11:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:11:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:11:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:12:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:12:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:12:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:12:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:12:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:12:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:12:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:12:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:12:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:12:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:12:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:12:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:12:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:12:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:12:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:12:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:12:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:12:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 00:12:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:12:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508639673] [2024-10-13 00:12:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508639673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:12:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:12:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 00:12:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440289986] [2024-10-13 00:12:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:12:00,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:12:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:12:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:12:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:12:00,142 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 00:12:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:12:00,295 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2024-10-13 00:12:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:12:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-10-13 00:12:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:12:00,299 INFO L225 Difference]: With dead ends: 240 [2024-10-13 00:12:00,299 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 00:12:00,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:12:00,305 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:12:00,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 366 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:12:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 00:12:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2024-10-13 00:12:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 00:12:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 173 transitions. [2024-10-13 00:12:00,338 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 173 transitions. Word has length 120 [2024-10-13 00:12:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:12:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 173 transitions. [2024-10-13 00:12:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 00:12:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 173 transitions. [2024-10-13 00:12:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 00:12:00,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:12:00,341 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:12:00,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:12:00,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:12:00,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:12:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1710280539, now seen corresponding path program 1 times [2024-10-13 00:12:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:12:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417987993] [2024-10-13 00:12:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:12:00,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:12:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:12:00,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:12:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:12:00,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:12:00,504 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:12:00,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:12:00,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:12:00,511 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:12:00,605 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:12:00,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:12:00 BoogieIcfgContainer [2024-10-13 00:12:00,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:12:00,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:12:00,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:12:00,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:12:00,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:56" (3/4) ... [2024-10-13 00:12:00,613 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:12:00,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:12:00,615 INFO L158 Benchmark]: Toolchain (without parser) took 5532.41ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 144.8MB in the beginning and 56.4MB in the end (delta: 88.3MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,615 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:12:00,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.94ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 133.2MB in the end (delta: 11.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.78ms. Allocated memory is still 176.2MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,618 INFO L158 Benchmark]: Boogie Preprocessor took 58.96ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,618 INFO L158 Benchmark]: RCFGBuilder took 652.14ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 107.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,619 INFO L158 Benchmark]: TraceAbstraction took 4367.04ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 107.3MB in the beginning and 56.4MB in the end (delta: 50.9MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2024-10-13 00:12:00,619 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 211.8MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:12:00,621 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.94ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 133.2MB in the end (delta: 11.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.78ms. Allocated memory is still 176.2MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.96ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.14ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 107.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4367.04ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 107.3MB in the beginning and 56.4MB in the end (delta: 50.9MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 211.8MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed short int var_1_2 = -256; [L24] signed long int var_1_3 = 256; [L25] unsigned char var_1_4 = 0; [L26] double var_1_5 = 127.5; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 10000000000000.125; [L29] double var_1_8 = 1.25; [L30] double var_1_9 = 4.125; [L31] double var_1_10 = 25.7; [L32] signed long int var_1_11 = -2; [L33] double var_1_12 = 49.75; [L34] signed long int var_1_13 = 5; [L35] signed long int var_1_14 = 128; [L36] signed long int var_1_15 = 1000; [L37] double var_1_16 = 0.2; [L38] double var_1_17 = 0.25; [L39] double var_1_18 = 99999999999999.5; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L97] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L98] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=256, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L99] var_1_3 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L100] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L101] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=0, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L102] var_1_4 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L103] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L104] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L105] var_1_6 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L106] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L107] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_7=80000000000001/8, var_1_8=5/4, var_1_9=33/8] [L108] var_1_7 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L109] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4, var_1_9=33/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] 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, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L111] 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, var_1_10=257/10, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=199/4, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L114] var_1_12 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L115] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L116] var_1_13 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L117] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L118] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L119] var_1_14 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L120] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L121] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L122] var_1_17 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L123] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L124] var_1_18 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L125] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L138] RET updateVariables() [L139] CALL step() [L43] signed long int stepLocal_0 = var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16))); VAL [isInitial=1, stepLocal_0=4, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L44] COND FALSE !(stepLocal_0 >= var_1_3) VAL [isInitial=1, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L47] signed long int stepLocal_2 = var_1_3; [L48] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L49] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=66, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=255/2, var_1_6=0, var_1_8=5/4] [L50] COND FALSE !(var_1_2 >= stepLocal_2) [L55] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_1=0, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=5/4] [L58] COND FALSE !(10.55f < var_1_5) VAL [isInitial=1, stepLocal_1=0, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=5/4] [L63] COND TRUE var_1_5 > var_1_7 [L64] var_1_8 = var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L69] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L70] COND FALSE !(((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L76] EXPR var_1_3 & var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L76] COND FALSE !((- var_1_2) > (var_1_3 & var_1_13)) [L87] var_1_15 = var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_16=1/5, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L89] COND TRUE ((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7 [L90] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, stepLocal_1=0, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR ((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L130-L131] return (((((((var_1_2 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= var_1_3) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_2 >= var_1_3) ? ((var_1_6 || (var_1_2 < var_1_3)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_5) ? ((var_1_5 > (var_1_7 * var_1_9)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_5 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (var_1_1 ? ((((((var_1_9) > (49.75)) ? (var_1_9) : (49.75))) > var_1_12) ? (var_1_11 == ((signed long int) ((((var_1_2) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (var_1_2) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) var_1_2)))) && (((- var_1_2) > (var_1_3 & var_1_13)) ? ((var_1_2 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_12) < (var_1_5)) ? (var_1_12) : (var_1_5))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, var_1_10=100000000000004, var_1_11=-2, var_1_13=0, var_1_14=-2147483647, var_1_15=0, var_1_1=1, var_1_2=65, var_1_3=66, var_1_4=1, var_1_5=100000000000005, var_1_6=0, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 759 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 272 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 1275 SizeOfPredicates, 1 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2910/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:12:00,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.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 d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:12:03,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:12:03,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:12:03,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:12:03,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:12:03,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:12:03,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:12:03,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:12:03,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:12:03,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:12:03,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:12:03,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:12:03,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:12:03,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:12:03,223 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:12:03,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:12:03,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:12:03,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:12:03,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:12:03,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:12:03,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:12:03,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:12:03,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:12:03,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:12:03,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:12:03,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:12:03,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:12:03,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:12:03,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:12:03,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:12:03,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:12:03,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:12:03,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:12:03,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:12:03,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:12:03,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:12:03,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:12:03,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:12:03,236 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:12:03,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:12:03,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:12:03,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:12:03,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:12:03,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:12:03,239 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:12:03,239 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 -> d10cd0607171a465ff2ca1ce03aa847fdf912d87f8dfda1b118440a87d224724 [2024-10-13 00:12:03,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:12:03,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:12:03,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:12:03,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:12:03,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:12:03,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-10-13 00:12:05,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:12:05,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:12:05,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i [2024-10-13 00:12:05,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66573d23/4b09dd94327041c2ae2f66bc69b9ad51/FLAG7db393574 [2024-10-13 00:12:05,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66573d23/4b09dd94327041c2ae2f66bc69b9ad51 [2024-10-13 00:12:05,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:12:05,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:12:05,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:12:05,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:12:05,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:12:05,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:05" (1/1) ... [2024-10-13 00:12:05,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711da27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:05, skipping insertion in model container [2024-10-13 00:12:05,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:05" (1/1) ... [2024-10-13 00:12:05,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:12:05,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2024-10-13 00:12:05,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:12:06,000 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:12:06,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-30.i[917,930] [2024-10-13 00:12:06,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:12:06,079 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:12:06,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06 WrapperNode [2024-10-13 00:12:06,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:12:06,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:12:06,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:12:06,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:12:06,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,145 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-13 00:12:06,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:12:06,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:12:06,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:12:06,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:12:06,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:12:06,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:12:06,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:12:06,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:12:06,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:12:06,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (1/1) ... [2024-10-13 00:12:06,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:12:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:12:06,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:12:06,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:12:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:12:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:12:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:12:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:12:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:12:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:12:06,403 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:12:06,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:12:17,974 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:12:17,975 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:12:18,039 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:12:18,040 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:12:18,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:18 BoogieIcfgContainer [2024-10-13 00:12:18,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:12:18,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:12:18,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:12:18,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:12:18,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:12:05" (1/3) ... [2024-10-13 00:12:18,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:18, skipping insertion in model container [2024-10-13 00:12:18,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:06" (2/3) ... [2024-10-13 00:12:18,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:18, skipping insertion in model container [2024-10-13 00:12:18,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:18" (3/3) ... [2024-10-13 00:12:18,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-30.i [2024-10-13 00:12:18,074 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:12:18,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:12:18,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:12:18,157 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;@1366b427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:12:18,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:12:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 00:12:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 00:12:18,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:12:18,176 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:12:18,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:12:18,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:12:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1562013753, now seen corresponding path program 1 times [2024-10-13 00:12:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:12:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602017065] [2024-10-13 00:12:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:12:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:12:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:12:18,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:12:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:12:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:18,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:12:18,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:12:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-10-13 00:12:18,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:12:18,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:12:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602017065] [2024-10-13 00:12:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602017065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:12:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:12:18,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:12:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954534220] [2024-10-13 00:12:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:12:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:12:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:12:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:12:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:12:18,793 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 00:12:22,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:12:22,987 INFO L93 Difference]: Finished difference Result 111 states and 196 transitions. [2024-10-13 00:12:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:12:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-10-13 00:12:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:12:23,039 INFO L225 Difference]: With dead ends: 111 [2024-10-13 00:12:23,039 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 00:12:23,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:12:23,046 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:12:23,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 00:12:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 00:12:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 00:12:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 00:12:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-10-13 00:12:23,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 115 [2024-10-13 00:12:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:12:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-10-13 00:12:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 00:12:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2024-10-13 00:12:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 00:12:23,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:12:23,103 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:12:23,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:12:23,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:12:23,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:12:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:12:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash 349138629, now seen corresponding path program 1 times [2024-10-13 00:12:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:12:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268408291] [2024-10-13 00:12:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:12:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:12:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:12:23,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:12:23,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:12:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:23,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:12:23,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:12:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 248 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 00:12:26,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:12:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-13 00:12:28,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:12:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268408291] [2024-10-13 00:12:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268408291] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:12:28,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:12:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-13 00:12:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286523542] [2024-10-13 00:12:28,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:12:28,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 00:12:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:12:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 00:12:28,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:12:28,411 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 00:12:34,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:38,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:42,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:12:42,980 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2024-10-13 00:12:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 00:12:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 115 [2024-10-13 00:12:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:12:42,983 INFO L225 Difference]: With dead ends: 128 [2024-10-13 00:12:42,984 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 00:12:42,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-10-13 00:12:42,986 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 124 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:12:42,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 158 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 167 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2024-10-13 00:12:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 00:12:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-13 00:12:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 00:12:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2024-10-13 00:12:43,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 115 [2024-10-13 00:12:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:12:43,010 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2024-10-13 00:12:43,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-13 00:12:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2024-10-13 00:12:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 00:12:43,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:12:43,012 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:12:43,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 00:12:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:12:43,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:12:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:12:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1335346964, now seen corresponding path program 1 times [2024-10-13 00:12:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:12:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653764231] [2024-10-13 00:12:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:12:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:12:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:12:43,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:12:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:12:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:12:43,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:12:43,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:12:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 00:12:43,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:12:43,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:12:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653764231] [2024-10-13 00:12:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653764231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:12:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:12:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:12:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170922042] [2024-10-13 00:12:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:12:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:12:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:12:43,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:12:43,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:12:43,700 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 00:12:46,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:48,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:51,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:52,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:53,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:55,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:12:59,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:13:01,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:13:05,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:13:09,811 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-10-13 00:13:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:13:10,226 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2024-10-13 00:13:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:13:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-10-13 00:13:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:13:10,231 INFO L225 Difference]: With dead ends: 170 [2024-10-13 00:13:10,231 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 00:13:10,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:13:10,233 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:13:10,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 162 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 26.5s Time] [2024-10-13 00:13:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 00:13:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-10-13 00:13:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 70 states have internal predecessors, (86), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:13:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2024-10-13 00:13:10,259 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 117 [2024-10-13 00:13:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:13:10,260 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2024-10-13 00:13:10,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 00:13:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2024-10-13 00:13:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 00:13:10,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:13:10,262 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:13:10,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 00:13:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:13:10,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:13:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:13:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2144693590, now seen corresponding path program 1 times [2024-10-13 00:13:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:13:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466334154] [2024-10-13 00:13:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:13:10,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:13:10,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:13:10,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:13:10,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 00:13:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:13:10,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 00:13:10,977 INFO L278 TraceCheckSpWp]: Computing forward predicates...