./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.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 3b2e3608467ce5fb389c9c299481f4e39ad254a246293f23d6cd670d2f095c1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:56:56,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:56:56,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:56:56,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:56:56,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:56:56,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:56:56,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:56:56,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:56:56,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:56:56,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:56:56,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:56:56,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:56:56,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:56:56,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:56:56,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:56:56,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:56:56,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:56:56,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:56:56,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:56:56,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:56:56,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:56:56,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:56:56,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:56:56,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:56:56,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:56:56,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:56:56,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:56:56,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:56,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:56:56,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:56:56,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:56:56,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:56:56,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:56:56,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:56:56,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:56:56,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:56:56,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:56:56,524 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 -> 3b2e3608467ce5fb389c9c299481f4e39ad254a246293f23d6cd670d2f095c1f [2024-11-18 22:56:56,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:56:56,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:56:56,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:56:56,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:56:56,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:56:56,819 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-60.i [2024-11-18 22:56:58,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:56:58,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:56:58,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.i [2024-11-18 22:56:58,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fcdc9bb/cf96c2b8c06448cfaeba02ff9590a900/FLAG118ac4a71 [2024-11-18 22:56:58,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fcdc9bb/cf96c2b8c06448cfaeba02ff9590a900 [2024-11-18 22:56:58,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:56:58,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:56:58,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:58,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:56:58,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:56:58,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ceea350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58, skipping insertion in model container [2024-11-18 22:56:58,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:56:58,686 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-60.i[915,928] [2024-11-18 22:56:58,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:58,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:56:58,748 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-60.i[915,928] [2024-11-18 22:56:58,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:56:58,780 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:56:58,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58 WrapperNode [2024-11-18 22:56:58,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:56:58,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:58,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:56:58,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:56:58,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,822 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-18 22:56:58,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:56:58,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:56:58,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:56:58,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:56:58,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,849 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:56:58,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:56:58,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:56:58,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:56:58,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:56:58,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (1/1) ... [2024-11-18 22:56:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:56:58,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:58,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:56:58,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:56:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:56:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:56:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:56:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:56:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:56:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:56:59,048 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:56:59,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:56:59,358 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 22:56:59,359 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:56:59,375 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:56:59,375 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:56:59,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:59 BoogieIcfgContainer [2024-11-18 22:56:59,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:56:59,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:56:59,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:56:59,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:56:59,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:56:58" (1/3) ... [2024-11-18 22:56:59,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cb05cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:59, skipping insertion in model container [2024-11-18 22:56:59,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:58" (2/3) ... [2024-11-18 22:56:59,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cb05cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:59, skipping insertion in model container [2024-11-18 22:56:59,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:59" (3/3) ... [2024-11-18 22:56:59,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-60.i [2024-11-18 22:56:59,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:56:59,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:56:59,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:56:59,476 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;@2859e7fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:56:59,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:56:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 22:56:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 22:56:59,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:56:59,498 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:56:59,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:56:59,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:56:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1812282281, now seen corresponding path program 1 times [2024-11-18 22:56:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:56:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502893237] [2024-11-18 22:56:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:56:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-18 22:56:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:56:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502893237] [2024-11-18 22:56:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502893237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:56:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725125624] [2024-11-18 22:56:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:56:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:56:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:56:59,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:56:59,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:56:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:56:59,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:56:59,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:56:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-18 22:56:59,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:56:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725125624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:56:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:56:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:56:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644491651] [2024-11-18 22:56:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:56:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:56:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:56:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:56:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:59,924 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 22:56:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:56:59,952 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-18 22:56:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:56:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-18 22:56:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:56:59,961 INFO L225 Difference]: With dead ends: 68 [2024-11-18 22:56:59,962 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 22:56:59,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:56:59,969 INFO L432 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:56:59,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:56:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 22:57:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 22:57:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 22:57:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-18 22:57:00,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 49 [2024-11-18 22:57:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:00,013 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-18 22:57:00,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 22:57:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-18 22:57:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 22:57:00,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:00,016 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:00,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 22:57:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:57:00,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -181298531, now seen corresponding path program 1 times [2024-11-18 22:57:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:57:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210508921] [2024-11-18 22:57:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:57:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 22:57:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:57:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210508921] [2024-11-18 22:57:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210508921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:57:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242761159] [2024-11-18 22:57:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:57:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:57:00,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:57:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:57:00,471 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:00,498 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-18 22:57:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:57:00,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-18 22:57:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:00,502 INFO L225 Difference]: With dead ends: 63 [2024-11-18 22:57:00,502 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 22:57:00,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:57:00,505 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:00,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:57:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 22:57:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 22:57:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 22:57:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-18 22:57:00,518 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 49 [2024-11-18 22:57:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:00,521 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-18 22:57:00,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-18 22:57:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 22:57:00,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:00,524 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:00,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:57:00,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:00,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -150514383, now seen corresponding path program 1 times [2024-11-18 22:57:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:57:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139232396] [2024-11-18 22:57:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:00,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:57:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 22:57:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:57:00,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139232396] [2024-11-18 22:57:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139232396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:57:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672747152] [2024-11-18 22:57:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:00,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:57:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:57:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:57:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:57:00,761 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:00,853 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2024-11-18 22:57:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:57:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-18 22:57:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:00,858 INFO L225 Difference]: With dead ends: 102 [2024-11-18 22:57:00,859 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 22:57:00,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:57:00,860 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:00,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:57:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 22:57:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2024-11-18 22:57:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:57:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-18 22:57:00,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 50 [2024-11-18 22:57:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:00,876 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-18 22:57:00,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-18 22:57:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-18 22:57:00,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:00,879 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:00,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:57:00,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:00,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -848587585, now seen corresponding path program 1 times [2024-11-18 22:57:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:57:00,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535616191] [2024-11-18 22:57:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:57:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:57:00,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:57:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:57:01,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:57:01,020 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:57:01,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:57:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:57:01,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 22:57:01,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:57:01,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:57:01 BoogieIcfgContainer [2024-11-18 22:57:01,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:57:01,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:57:01,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:57:01,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:57:01,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:59" (3/4) ... [2024-11-18 22:57:01,076 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:57:01,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:57:01,078 INFO L158 Benchmark]: Toolchain (without parser) took 2623.72ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 47.0MB in the end (delta: 93.1MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,078 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 159.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:57:01,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.66ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.71ms. Allocated memory is still 174.1MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,079 INFO L158 Benchmark]: Boogie Preprocessor took 40.22ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,079 INFO L158 Benchmark]: RCFGBuilder took 512.42ms. Allocated memory is still 174.1MB. Free memory was 121.4MB in the beginning and 137.2MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,080 INFO L158 Benchmark]: TraceAbstraction took 1694.64ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 48.1MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-18 22:57:01,080 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 174.1MB. Free memory was 48.1MB in the beginning and 47.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:57:01,082 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 104.9MB. Free memory was 75.1MB in the beginning and 75.0MB in the end (delta: 159.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.66ms. Allocated memory is still 174.1MB. Free memory was 139.2MB in the beginning and 125.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.71ms. Allocated memory is still 174.1MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.22ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.42ms. Allocated memory is still 174.1MB. Free memory was 121.4MB in the beginning and 137.2MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1694.64ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 48.1MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 174.1MB. Free memory was 48.1MB in the beginning and 47.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] RET updateLastVariables() [L86] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L86] RET updateVariables() [L87] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L87] RET step() [L88] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 123 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 135 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 230/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:57:01,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.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 3b2e3608467ce5fb389c9c299481f4e39ad254a246293f23d6cd670d2f095c1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:57:03,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:57:03,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:57:03,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:57:03,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:57:03,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:57:03,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:57:03,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:57:03,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:57:03,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:57:03,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:57:03,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:57:03,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:57:03,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:57:03,487 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:57:03,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:57:03,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:57:03,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:57:03,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:57:03,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:57:03,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:57:03,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:57:03,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:57:03,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:57:03,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:57:03,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:57:03,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:57:03,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:57:03,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:57:03,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:03,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:57:03,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:57:03,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:57:03,497 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:57:03,497 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:57:03,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:57:03,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:57:03,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:57:03,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:57:03,499 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 -> 3b2e3608467ce5fb389c9c299481f4e39ad254a246293f23d6cd670d2f095c1f [2024-11-18 22:57:03,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:57:03,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:57:03,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:57:03,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:57:03,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:57:03,848 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-60.i [2024-11-18 22:57:05,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:57:05,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:57:05,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.i [2024-11-18 22:57:05,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fed1c3a/2dd6654aadf44606b34ff4f25aca7269/FLAG6d60339ec [2024-11-18 22:57:05,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0fed1c3a/2dd6654aadf44606b34ff4f25aca7269 [2024-11-18 22:57:05,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:57:05,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:57:05,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:05,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:57:05,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:57:05,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:05" (1/1) ... [2024-11-18 22:57:05,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ad31d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:05, skipping insertion in model container [2024-11-18 22:57:05,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:57:05" (1/1) ... [2024-11-18 22:57:05,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:57:05,976 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-60.i[915,928] [2024-11-18 22:57:06,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:06,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:57:06,060 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-60.i[915,928] [2024-11-18 22:57:06,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:57:06,125 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:57:06,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06 WrapperNode [2024-11-18 22:57:06,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:57:06,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:06,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:57:06,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:57:06,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,180 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-18 22:57:06,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:57:06,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:57:06,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:57:06,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:57:06,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:57:06,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:57:06,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:57:06,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:57:06,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:57:06,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (1/1) ... [2024-11-18 22:57:06,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:57:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:57:06,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:57:06,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:57:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:57:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:57:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:57:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:57:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:57:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:57:06,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:57:06,390 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:57:15,174 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 22:57:15,175 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:57:15,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:57:15,190 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:57:15,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:15 BoogieIcfgContainer [2024-11-18 22:57:15,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:57:15,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:57:15,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:57:15,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:57:15,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:57:05" (1/3) ... [2024-11-18 22:57:15,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da92cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:15, skipping insertion in model container [2024-11-18 22:57:15,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:57:06" (2/3) ... [2024-11-18 22:57:15,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da92cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:57:15, skipping insertion in model container [2024-11-18 22:57:15,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:57:15" (3/3) ... [2024-11-18 22:57:15,199 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-60.i [2024-11-18 22:57:15,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:57:15,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:57:15,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:57:15,290 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;@7db95d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:57:15,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:57:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 22:57:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 22:57:15,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:15,305 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:15,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:15,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1812282281, now seen corresponding path program 1 times [2024-11-18 22:57:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178358227] [2024-11-18 22:57:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:15,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:15,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:57:15,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:57:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:15,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:57:15,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 22:57:15,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:57:15,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:57:15,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178358227] [2024-11-18 22:57:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178358227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:57:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137777601] [2024-11-18 22:57:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:57:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:57:15,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:57:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:15,801 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 22:57:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:15,820 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-18 22:57:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:57:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-18 22:57:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:15,830 INFO L225 Difference]: With dead ends: 68 [2024-11-18 22:57:15,830 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 22:57:15,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:57:15,839 INFO L432 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:15,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:57:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 22:57:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 22:57:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 22:57:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-18 22:57:15,885 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 49 [2024-11-18 22:57:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:15,886 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-18 22:57:15,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 22:57:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-18 22:57:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 22:57:15,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:15,890 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:15,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 22:57:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:16,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:16,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -181298531, now seen corresponding path program 1 times [2024-11-18 22:57:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813204032] [2024-11-18 22:57:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:16,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:16,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:57:16,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:57:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:16,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 22:57:16,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 22:57:16,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:57:16,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:57:16,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813204032] [2024-11-18 22:57:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813204032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:16,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:16,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:57:16,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507826903] [2024-11-18 22:57:16,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:16,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:57:16,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:57:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:57:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:57:16,964 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:21,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:25,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:29,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:33,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:37,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:37,580 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2024-11-18 22:57:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:57:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-18 22:57:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:37,620 INFO L225 Difference]: With dead ends: 104 [2024-11-18 22:57:37,620 INFO L226 Difference]: Without dead ends: 74 [2024-11-18 22:57:37,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:57:37,630 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:37,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-11-18 22:57:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-18 22:57:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-11-18 22:57:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:57:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2024-11-18 22:57:37,648 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 49 [2024-11-18 22:57:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2024-11-18 22:57:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2024-11-18 22:57:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 22:57:37,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:37,651 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:37,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:57:37,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:37,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:37,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash 211824975, now seen corresponding path program 1 times [2024-11-18 22:57:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:37,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110048821] [2024-11-18 22:57:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:37,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:37,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:37,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:57:37,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 22:57:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:38,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 22:57:38,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:57:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 22:57:38,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:57:38,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:57:38,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110048821] [2024-11-18 22:57:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110048821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:57:38,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:57:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:57:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032018087] [2024-11-18 22:57:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:57:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:57:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:57:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:57:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:57:38,657 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:42,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:46,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 22:57:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:57:46,258 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2024-11-18 22:57:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:57:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-18 22:57:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:57:46,316 INFO L225 Difference]: With dead ends: 119 [2024-11-18 22:57:46,316 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 22:57:46,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:57:46,319 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-18 22:57:46,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-18 22:57:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 22:57:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 22:57:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 22:57:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-18 22:57:46,343 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 50 [2024-11-18 22:57:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:57:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-18 22:57:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-18 22:57:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-18 22:57:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-18 22:57:46,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:57:46,348 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:57:46,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 22:57:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:46,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:57:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:57:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash -848587585, now seen corresponding path program 1 times [2024-11-18 22:57:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:57:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366255783] [2024-11-18 22:57:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:57:46,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:57:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:57:46,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:57:46,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 22:57:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:57:46,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 22:57:46,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:58:25,295 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)