./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.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 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:50:29,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:50:29,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:50:29,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:50:29,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:50:29,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:50:29,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:50:29,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:50:29,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:50:29,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:50:29,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:50:29,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:50:29,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:50:29,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:50:29,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:50:29,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:50:29,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:50:29,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:50:29,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:50:29,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:50:29,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:50:29,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:50:29,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:50:29,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:50:29,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:50:29,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:50:29,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:50:29,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:50:29,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:50:29,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:50:29,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:50:29,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:50:29,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:29,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:50:29,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:50:29,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:50:29,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:50:29,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:50:29,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:50:29,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:50:29,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:50:29,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:50:29,447 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 -> 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 [2024-11-08 23:50:29,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:50:29,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:50:29,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:50:29,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:50:29,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:50:29,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:31,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:50:31,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:50:31,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:31,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ec1900f/2a04abbaa9a7467eb9496a98118adb9f/FLAG63ed5bbc6 [2024-11-08 23:50:31,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ec1900f/2a04abbaa9a7467eb9496a98118adb9f [2024-11-08 23:50:31,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:50:31,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:50:31,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:31,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:50:31,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:50:31,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef03d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31, skipping insertion in model container [2024-11-08 23:50:31,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:50:31,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2024-11-08 23:50:31,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:31,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:50:31,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2024-11-08 23:50:31,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:31,754 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:50:31,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31 WrapperNode [2024-11-08 23:50:31,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:31,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:31,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:50:31,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:50:31,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,826 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-08 23:50:31,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:31,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:50:31,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:50:31,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:50:31,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:50:31,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:50:31,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:50:31,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:50:31,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:50:31,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (1/1) ... [2024-11-08 23:50:31,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:50:31,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:50:31,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:50:32,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:50:32,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:50:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:50:32,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:50:32,107 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:50:32,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:50:32,421 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:50:32,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:50:32,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:50:32,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:50:32,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:32 BoogieIcfgContainer [2024-11-08 23:50:32,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:50:32,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:50:32,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:50:32,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:50:32,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:50:31" (1/3) ... [2024-11-08 23:50:32,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124ae76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:32, skipping insertion in model container [2024-11-08 23:50:32,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:31" (2/3) ... [2024-11-08 23:50:32,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124ae76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:32, skipping insertion in model container [2024-11-08 23:50:32,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:32" (3/3) ... [2024-11-08 23:50:32,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:32,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:50:32,469 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:50:32,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:50:32,559 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;@17339d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:50:32,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:50:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:50:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:50:32,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:32,577 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:50:32,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:32,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2027500392, now seen corresponding path program 1 times [2024-11-08 23:50:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:50:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417161513] [2024-11-08 23:50:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:50:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:50:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:50:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:50:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:50:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:50:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:50:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:50:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:50:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:50:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 23:50:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:50:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417161513] [2024-11-08 23:50:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417161513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:32,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:50:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213947851] [2024-11-08 23:50:32,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:50:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:50:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:50:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:50:32,872 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 23:50:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:32,910 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2024-11-08 23:50:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:50:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-08 23:50:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:32,919 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:50:32,920 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:50:32,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:50:32,930 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:50:32,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:50:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:50:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:50:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:50:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 23:50:32,966 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2024-11-08 23:50:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:32,966 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 23:50:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-08 23:50:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 23:50:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:50:32,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:32,969 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:50:32,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:50:32,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash -606886932, now seen corresponding path program 1 times [2024-11-08 23:50:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:50:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871411122] [2024-11-08 23:50:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:50:33,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:50:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:50:33,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:50:33,294 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:50:33,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:50:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:50:33,301 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 23:50:33,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:50:33,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:50:33 BoogieIcfgContainer [2024-11-08 23:50:33,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:50:33,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:50:33,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:50:33,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:50:33,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:32" (3/4) ... [2024-11-08 23:50:33,366 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:50:33,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:50:33,367 INFO L158 Benchmark]: Toolchain (without parser) took 1919.58ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 86.6MB in the beginning and 165.1MB in the end (delta: -78.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:50:33,369 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:50:33,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.79ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 72.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:50:33,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.57ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:50:33,370 INFO L158 Benchmark]: Boogie Preprocessor took 80.52ms. Allocated memory is still 159.4MB. Free memory was 70.4MB in the beginning and 67.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:50:33,370 INFO L158 Benchmark]: RCFGBuilder took 529.74ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 67.1MB in the beginning and 170.8MB in the end (delta: -103.7MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-08 23:50:33,371 INFO L158 Benchmark]: TraceAbstraction took 921.96ms. Allocated memory is still 207.6MB. Free memory was 169.8MB in the beginning and 165.1MB in the end (delta: 4.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-11-08 23:50:33,371 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 207.6MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:50:33,376 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.21ms. Allocated memory is still 159.4MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.79ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 72.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.57ms. Allocated memory is still 159.4MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.52ms. Allocated memory is still 159.4MB. Free memory was 70.4MB in the beginning and 67.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 529.74ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 67.1MB in the beginning and 170.8MB in the end (delta: -103.7MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 921.96ms. Allocated memory is still 207.6MB. Free memory was 169.8MB in the beginning and 165.1MB in the end (delta: 4.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 207.6MB. Free memory is still 165.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 9.3; [L25] float var_1_4 = 3.4; [L26] unsigned short int var_1_5 = 32; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 64; [L29] unsigned short int var_1_8 = 16; [L30] unsigned short int var_1_9 = 1; VAL [isInitial=0, var_1_1=5/2, var_1_2=0, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L60] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L61] var_1_4 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L62] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L65] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L66] var_1_7 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L68] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L69] var_1_8 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L71] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L34] COND TRUE \read(var_1_2) [L35] var_1_1 = var_1_3 VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L41] COND FALSE !((var_1_1 + 8.125) > (var_1_1 * var_1_3)) [L44] var_1_5 = var_1_8 VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L46] signed long int stepLocal_0 = 5 * var_1_8; VAL [isInitial=1, stepLocal_0=327670, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L47] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=327670, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return ((var_1_2 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_6 + var_1_7)) > (var_1_8)) ? ((var_1_6 + var_1_7)) : (var_1_8))))) : (var_1_5 == ((unsigned short int) var_1_8)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_6 > (5 * var_1_8)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_6)) : 1) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:50:33,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.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 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:50:35,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:50:35,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:50:35,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:50:35,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:50:35,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:50:35,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:50:35,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:50:35,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:50:35,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:50:35,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:50:35,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:50:35,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:50:35,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:50:35,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:50:35,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:50:35,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:50:35,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:50:35,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:50:35,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:50:35,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:50:35,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:50:35,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:50:35,830 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:50:35,830 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:50:35,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:50:35,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:50:35,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:50:35,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:50:35,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:50:35,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:50:35,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:50:35,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:50:35,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:50:35,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:35,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:50:35,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:50:35,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:50:35,836 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:50:35,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:50:35,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:50:35,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:50:35,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:50:35,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:50:35,838 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 -> 84b9b484a0a851d8bdc3d133b59eb42adec2817266fa068895794fd4caa48d14 [2024-11-08 23:50:36,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:50:36,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:50:36,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:50:36,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:50:36,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:50:36,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:37,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:50:38,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:50:38,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:38,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e691796/8e21e7a25a9246acbef581154a25c859/FLAG4feafec4f [2024-11-08 23:50:38,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e691796/8e21e7a25a9246acbef581154a25c859 [2024-11-08 23:50:38,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:50:38,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:50:38,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:38,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:50:38,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:50:38,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a817224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38, skipping insertion in model container [2024-11-08 23:50:38,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:50:38,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2024-11-08 23:50:38,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:38,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:50:38,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-29.i[915,928] [2024-11-08 23:50:38,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:50:38,503 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:50:38,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38 WrapperNode [2024-11-08 23:50:38,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:50:38,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:38,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:50:38,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:50:38,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,557 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-08 23:50:38,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:50:38,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:50:38,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:50:38,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:50:38,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:50:38,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:50:38,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:50:38,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:50:38,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:50:38,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (1/1) ... [2024-11-08 23:50:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:50:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:50:38,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:50:38,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:50:38,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:50:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:50:38,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:50:38,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:50:38,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:50:46,407 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:50:46,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:50:46,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:50:46,419 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:50:46,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:46 BoogieIcfgContainer [2024-11-08 23:50:46,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:50:46,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:50:46,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:50:46,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:50:46,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:50:38" (1/3) ... [2024-11-08 23:50:46,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee30147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:46, skipping insertion in model container [2024-11-08 23:50:46,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:50:38" (2/3) ... [2024-11-08 23:50:46,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee30147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:50:46, skipping insertion in model container [2024-11-08 23:50:46,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:50:46" (3/3) ... [2024-11-08 23:50:46,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-29.i [2024-11-08 23:50:46,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:50:46,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:50:46,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:50:46,510 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;@1cef19f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:50:46,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:50:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:50:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:50:46,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:46,524 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:50:46,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2027500392, now seen corresponding path program 1 times [2024-11-08 23:50:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965851320] [2024-11-08 23:50:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:50:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:46,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:50:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:50:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:46,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:50:46,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-08 23:50:46,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:50:46,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965851320] [2024-11-08 23:50:46,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965851320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:50:46,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:50:46,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:50:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746390093] [2024-11-08 23:50:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:50:46,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:50:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:50:46,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:50:46,962 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 23:50:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:50:46,995 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2024-11-08 23:50:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:50:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-08 23:50:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:50:47,007 INFO L225 Difference]: With dead ends: 77 [2024-11-08 23:50:47,008 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:50:47,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:50:47,017 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:50:47,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:50:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:50:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:50:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:50:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-08 23:50:47,065 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2024-11-08 23:50:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:50:47,066 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-08 23:50:47,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 23:50:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-08 23:50:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:50:47,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:50:47,071 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:50:47,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:50:47,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:50:47,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:50:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:50:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash -606886932, now seen corresponding path program 1 times [2024-11-08 23:50:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:50:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444692874] [2024-11-08 23:50:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:50:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:50:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:50:47,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:50:47,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:50:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:47,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:50:47,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:50:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 23:50:48,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:50:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-08 23:50:49,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:50:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444692874] [2024-11-08 23:50:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444692874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:50:49,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:50:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-08 23:50:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247399203] [2024-11-08 23:50:49,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:50:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:50:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:50:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:50:49,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:50:49,541 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 23:50:52,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:50:55,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:50:57,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:01,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:04,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:08,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:10,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:12,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:51:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:51:12,916 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2024-11-08 23:51:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 23:51:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 69 [2024-11-08 23:51:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:51:12,920 INFO L225 Difference]: With dead ends: 118 [2024-11-08 23:51:12,920 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 23:51:12,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:51:12,926 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:51:12,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 124 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 22.4s Time] [2024-11-08 23:51:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 23:51:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2024-11-08 23:51:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:51:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-08 23:51:12,950 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 69 [2024-11-08 23:51:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:51:12,953 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-08 23:51:12,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 23:51:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-08 23:51:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 23:51:12,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:51:12,955 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:51:12,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:51:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:51:13,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:51:13,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:51:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2039113878, now seen corresponding path program 1 times [2024-11-08 23:51:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:51:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770999602] [2024-11-08 23:51:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:51:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:51:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:51:13,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:51:13,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:51:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:13,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:51:13,412 INFO L278 TraceCheckSpWp]: Computing forward predicates...