./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-38.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 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:35:02,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:35:02,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:35:02,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:35:02,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:35:02,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:35:02,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:35:02,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:35:02,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:35:02,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:35:02,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:35:02,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:35:02,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:35:02,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:35:02,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:35:02,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:35:02,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:35:02,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:35:02,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:35:02,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:35:02,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:35:02,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:35:02,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:35:02,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:35:02,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:35:02,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:35:02,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:35:02,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:35:02,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:35:02,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:35:02,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:35:02,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:35:02,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:02,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:35:02,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:35:02,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:35:02,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:35:02,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:35:02,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:35:02,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:35:02,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:35:02,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:35:02,505 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 -> 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797 [2024-11-10 07:35:02,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:35:02,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:35:02,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:35:02,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:35:02,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:35:02,795 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-38.i [2024-11-10 07:35:04,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:35:04,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:35:04,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i [2024-11-10 07:35:04,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0577a99c/2c587e9012664f3e86476df795c55ab7/FLAGde3d835ee [2024-11-10 07:35:04,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0577a99c/2c587e9012664f3e86476df795c55ab7 [2024-11-10 07:35:04,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:35:04,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:35:04,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:04,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:35:04,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:35:04,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37eefbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04, skipping insertion in model container [2024-11-10 07:35:04,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:35:04,747 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-38.i[915,928] [2024-11-10 07:35:04,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:04,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:35:04,802 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-38.i[915,928] [2024-11-10 07:35:04,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:04,858 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:35:04,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04 WrapperNode [2024-11-10 07:35:04,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:04,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:04,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:35:04,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:35:04,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,916 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-10 07:35:04,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:04,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:35:04,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:35:04,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:35:04,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,983 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-10 07:35:04,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:04,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:35:05,020 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:35:05,020 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:35:05,020 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:35:05,021 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (1/1) ... [2024-11-10 07:35:05,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:05,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:35:05,060 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-10 07:35:05,063 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-10 07:35:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:35:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:35:05,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:35:05,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:35:05,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:35:05,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:35:05,205 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:35:05,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:35:05,510 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 07:35:05,512 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:35:05,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:35:05,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:35:05,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:05 BoogieIcfgContainer [2024-11-10 07:35:05,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:35:05,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:35:05,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:35:05,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:35:05,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:35:04" (1/3) ... [2024-11-10 07:35:05,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182acf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:05, skipping insertion in model container [2024-11-10 07:35:05,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:04" (2/3) ... [2024-11-10 07:35:05,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182acf13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:05, skipping insertion in model container [2024-11-10 07:35:05,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:05" (3/3) ... [2024-11-10 07:35:05,550 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-38.i [2024-11-10 07:35:05,570 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:35:05,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:35:05,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:35:05,656 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;@2fdf8b5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:35:05,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:35:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:35:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 07:35:05,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:05,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:35:05,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:05,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1915177393, now seen corresponding path program 1 times [2024-11-10 07:35:05,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833012429] [2024-11-10 07:35:05,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:35:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:35:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:35:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:35:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:35:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:35:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:35:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:35:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:35:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:35:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:35:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:35:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:35:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:35:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:35:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 07:35:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833012429] [2024-11-10 07:35:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833012429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:06,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:35:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47497390] [2024-11-10 07:35:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:06,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:35:06,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:35:06,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:35:06,086 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:35:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:06,107 INFO L93 Difference]: Finished difference Result 108 states and 179 transitions. [2024-11-10 07:35:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:35:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-10 07:35:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:06,118 INFO L225 Difference]: With dead ends: 108 [2024-11-10 07:35:06,118 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:35:06,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10 07:35:06,130 INFO L432 NwaCegarLoop]: 75 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, 75 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-10 07:35:06,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:35:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:35:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:35:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:35:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-10 07:35:06,176 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 126 [2024-11-10 07:35:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:06,176 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-10 07:35:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:35:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-10 07:35:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 07:35:06,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:06,180 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:35:06,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:35:06,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:06,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 636064173, now seen corresponding path program 1 times [2024-11-10 07:35:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463022586] [2024-11-10 07:35:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:35:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:35:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:35:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:35:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:35:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:35:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:06,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:35:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:35:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:35:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:35:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:35:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:35:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 07:35:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:35:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 07:35:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 07:35:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 07:35:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:35:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:35:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:35:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-10 07:35:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:35:07,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463022586] [2024-11-10 07:35:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463022586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:35:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275815294] [2024-11-10 07:35:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:35:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:35:07,234 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-10 07:35:07,239 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-10 07:35:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:07,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:35:07,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:35:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 272 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-10 07:35:08,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:35:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 07:35:08,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275815294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:35:08,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:35:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16 [2024-11-10 07:35:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525756542] [2024-11-10 07:35:08,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:35:08,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 07:35:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:35:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 07:35:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:35:08,638 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-10 07:35:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:09,123 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2024-11-10 07:35:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:35:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 126 [2024-11-10 07:35:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:09,126 INFO L225 Difference]: With dead ends: 117 [2024-11-10 07:35:09,126 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 07:35:09,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2024-11-10 07:35:09,128 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:35:09,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 230 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:35:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 07:35:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-10 07:35:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:35:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-10 07:35:09,144 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 126 [2024-11-10 07:35:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:09,145 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-10 07:35:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (39), 3 states have call predecessors, (39), 7 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-10 07:35:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-10 07:35:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 07:35:09,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:09,148 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:35:09,168 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-10 07:35:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:35:09,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1916092788, now seen corresponding path program 1 times [2024-11-10 07:35:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:35:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906993030] [2024-11-10 07:35:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:35:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:35:09,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:35:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:35:09,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:35:09,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:35:09,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:35:09,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:35:09,589 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 07:35:09,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:35:09,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:35:09 BoogieIcfgContainer [2024-11-10 07:35:09,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:35:09,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:35:09,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:35:09,665 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:35:09,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:05" (3/4) ... [2024-11-10 07:35:09,667 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:35:09,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:35:09,669 INFO L158 Benchmark]: Toolchain (without parser) took 5139.18ms. Allocated memory was 134.2MB in the beginning and 262.1MB in the end (delta: 127.9MB). Free memory was 63.6MB in the beginning and 142.3MB in the end (delta: -78.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,669 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:35:09,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.88ms. Allocated memory is still 134.2MB. Free memory was 63.6MB in the beginning and 48.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,670 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.73ms. Allocated memory is still 134.2MB. Free memory was 48.9MB in the beginning and 46.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,670 INFO L158 Benchmark]: Boogie Preprocessor took 77.28ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 46.0MB in the beginning and 158.0MB in the end (delta: -112.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,670 INFO L158 Benchmark]: IcfgBuilder took 517.41ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 143.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,671 INFO L158 Benchmark]: TraceAbstraction took 4123.42ms. Allocated memory was 190.8MB in the beginning and 262.1MB in the end (delta: 71.3MB). Free memory was 142.5MB in the beginning and 143.4MB in the end (delta: -844.0kB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. [2024-11-10 07:35:09,671 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 262.1MB. Free memory was 143.4MB in the beginning and 142.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:35:09,673 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.14ms. Allocated memory is still 134.2MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.88ms. Allocated memory is still 134.2MB. Free memory was 63.6MB in the beginning and 48.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.73ms. Allocated memory is still 134.2MB. Free memory was 48.9MB in the beginning and 46.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.28ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 46.0MB in the beginning and 158.0MB in the end (delta: -112.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * IcfgBuilder took 517.41ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 143.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4123.42ms. Allocated memory was 190.8MB in the beginning and 262.1MB in the end (delta: 71.3MB). Free memory was 142.5MB in the beginning and 143.4MB in the end (delta: -844.0kB). Peak memory consumption was 72.6MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 262.1MB. Free memory was 143.4MB in the beginning and 142.3MB 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 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_ushort() [L59] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L59] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L61] var_1_3 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L62] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L65] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] var_1_6 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] var_1_8 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L71] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L73] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L75] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L76] var_1_11 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L77] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L81] var_1_14 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L82] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L84] var_1_15 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] var_1_16 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L88] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L42] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-32769, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L43] COND FALSE !(stepLocal_0 > var_1_2) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L46] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L47] COND TRUE ! var_1_13 [L48] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return (((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3)))) ; VAL [\result=0, isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L19] reach_error() VAL [isInitial=1, var_1_12=65073, var_1_13=0, var_1_14=16844, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=65534, var_1_3=-1103822850, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 127 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911 SizeOfPredicates, 3 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2749/3040 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-10 07:35:09,712 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-38.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 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:35:12,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:35:12,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:35:12,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:35:12,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:35:12,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:35:12,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:35:12,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:35:12,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:35:12,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:35:12,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:35:12,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:35:12,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:35:12,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:35:12,255 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:35:12,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:35:12,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:35:12,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:35:12,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:35:12,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:35:12,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:35:12,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:35:12,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:35:12,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:35:12,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:35:12,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:35:12,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:35:12,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:35:12,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:35:12,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:35:12,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:35:12,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:35:12,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:35:12,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:35:12,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:12,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:35:12,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:35:12,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:35:12,268 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:35:12,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:35:12,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:35:12,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:35:12,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:35:12,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:35:12,269 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 -> 8ecb8a86c5100f100392f33b5049e59f5466347bbc0a9c9e82d59cb07a715797 [2024-11-10 07:35:12,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:35:12,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:35:12,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:35:12,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:35:12,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:35:12,615 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-38.i [2024-11-10 07:35:14,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:35:14,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:35:14,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-38.i [2024-11-10 07:35:14,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945a6a27d/44bccafa40c544729923fa9a934354b7/FLAGb76f2d3b7 [2024-11-10 07:35:14,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945a6a27d/44bccafa40c544729923fa9a934354b7 [2024-11-10 07:35:14,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:35:14,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:35:14,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:14,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:35:14,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:35:14,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:14" (1/1) ... [2024-11-10 07:35:14,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5b2057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:14, skipping insertion in model container [2024-11-10 07:35:14,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:14" (1/1) ... [2024-11-10 07:35:14,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:35:15,216 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-38.i[915,928] [2024-11-10 07:35:15,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:15,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:35:15,276 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-38.i[915,928] [2024-11-10 07:35:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:35:15,324 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:35:15,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15 WrapperNode [2024-11-10 07:35:15,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:35:15,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:15,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:35:15,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:35:15,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,387 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-10 07:35:15,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:35:15,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:35:15,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:35:15,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:35:15,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,423 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-10 07:35:15,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:35:15,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:35:15,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:35:15,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:35:15,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (1/1) ... [2024-11-10 07:35:15,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:35:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:35:15,482 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-10 07:35:15,485 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-10 07:35:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:35:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:35:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:35:15,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:35:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:35:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:35:15,605 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:35:15,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:35:20,076 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 07:35:20,076 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:35:20,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:35:20,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:35:20,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:20 BoogieIcfgContainer [2024-11-10 07:35:20,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:35:20,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:35:20,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:35:20,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:35:20,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:35:14" (1/3) ... [2024-11-10 07:35:20,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2658c7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:20, skipping insertion in model container [2024-11-10 07:35:20,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:15" (2/3) ... [2024-11-10 07:35:20,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2658c7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:35:20, skipping insertion in model container [2024-11-10 07:35:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:35:20" (3/3) ... [2024-11-10 07:35:20,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-38.i [2024-11-10 07:35:20,127 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:35:20,127 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:35:20,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:35:20,211 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;@6e09afcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:35:20,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:35:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:35:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 07:35:20,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:20,239 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:35:20,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:20,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1915177393, now seen corresponding path program 1 times [2024-11-10 07:35:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:35:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748280401] [2024-11-10 07:35:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:20,267 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-10 07:35:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:35:20,274 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-10 07:35:20,283 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-10 07:35:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:20,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:35:20,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:35:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-10 07:35:20,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:35:20,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:35:20,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748280401] [2024-11-10 07:35:20,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748280401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:35:20,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:35:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:35:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738358242] [2024-11-10 07:35:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:35:20,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:35:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:35:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:35:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:35:20,743 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:35:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:35:20,785 INFO L93 Difference]: Finished difference Result 108 states and 179 transitions. [2024-11-10 07:35:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:35:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-10 07:35:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:35:20,794 INFO L225 Difference]: With dead ends: 108 [2024-11-10 07:35:20,795 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:35:20,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-10 07:35:20,801 INFO L432 NwaCegarLoop]: 75 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, 75 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-10 07:35:20,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:35:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:35:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:35:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 07:35:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-10 07:35:20,849 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 126 [2024-11-10 07:35:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:35:20,850 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-10 07:35:20,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 07:35:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-10 07:35:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 07:35:20,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:35:20,853 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:35:20,873 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-10 07:35:21,057 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-10 07:35:21,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:35:21,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:35:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 636064173, now seen corresponding path program 1 times [2024-11-10 07:35:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:35:21,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760638802] [2024-11-10 07:35:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:35:21,061 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-10 07:35:21,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:35:21,065 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-10 07:35:21,066 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-10 07:35:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:35:22,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 07:35:22,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:35:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 231 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-10 07:35:52,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:36:05,133 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)