./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.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_50-while_file-22.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 b9431012a5c272f0c5097cc7c5500cb3cd7eb3fc8e8dca0bbde243a270d6fb41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:54:53,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:54:53,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:54:53,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:54:53,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:54:53,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:54:53,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:54:53,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:54:53,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:54:53,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:54:53,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:54:53,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:54:53,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:54:53,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:54:53,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:54:53,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:54:53,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:54:53,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:54:53,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:54:53,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:54:53,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:54:53,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:54:53,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:54:53,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:54:53,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:54:53,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:54:53,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:54:53,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:54:53,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:54:53,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:54:53,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:54:53,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:54:53,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:54:53,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:54:53,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:54:53,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:54:53,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:54:53,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:54:53,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:54:53,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:54:53,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:54:53,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:54:53,778 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 -> b9431012a5c272f0c5097cc7c5500cb3cd7eb3fc8e8dca0bbde243a270d6fb41 [2024-11-10 07:54:53,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:54:54,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:54:54,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:54:54,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:54:54,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:54:54,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:54:55,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:54:55,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:54:55,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:54:55,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962cd84e4/326cc7c5eb434447a3d1eb9ba1bf67c4/FLAGfd35113e5 [2024-11-10 07:54:55,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962cd84e4/326cc7c5eb434447a3d1eb9ba1bf67c4 [2024-11-10 07:54:55,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:54:55,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:54:55,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:54:55,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:54:55,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:54:55,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:54:55" (1/1) ... [2024-11-10 07:54:55,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f778d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:55, skipping insertion in model container [2024-11-10 07:54:55,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:54:55" (1/1) ... [2024-11-10 07:54:55,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:54:56,034 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_50-while_file-22.i[915,928] [2024-11-10 07:54:56,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:54:56,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:54:56,112 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_50-while_file-22.i[915,928] [2024-11-10 07:54:56,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:54:56,162 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:54:56,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56 WrapperNode [2024-11-10 07:54:56,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:54:56,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:54:56,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:54:56,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:54:56,172 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:54:56" (1/1) ... [2024-11-10 07:54:56,188 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:54:56" (1/1) ... [2024-11-10 07:54:56,231 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-10 07:54:56,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:54:56,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:54:56,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:54:56,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:54:56,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,270 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:54:56,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:54:56,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:54:56,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:54:56,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:54:56,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (1/1) ... [2024-11-10 07:54:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:54:56,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:54:56,332 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:54:56,335 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:54:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:54:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:54:56,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:54:56,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:54:56,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:54:56,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:54:56,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:54:56,481 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:54:56,783 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 07:54:56,834 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:54:56,834 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:54:56,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:54:56,859 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:54:56,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:54:56 BoogieIcfgContainer [2024-11-10 07:54:56,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:54:56,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:54:56,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:54:56,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:54:56,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:54:55" (1/3) ... [2024-11-10 07:54:56,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e4fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:54:56, skipping insertion in model container [2024-11-10 07:54:56,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:54:56" (2/3) ... [2024-11-10 07:54:56,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5e4fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:54:56, skipping insertion in model container [2024-11-10 07:54:56,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:54:56" (3/3) ... [2024-11-10 07:54:56,871 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:54:56,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:54:56,889 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:54:56,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:54:56,957 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;@490a88a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:54:56,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:54:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:54:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 07:54:56,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:56,985 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -43971483, now seen corresponding path program 1 times [2024-11-10 07:54:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:54:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946621139] [2024-11-10 07:54:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:54:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:54:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:54:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:54:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:54:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:54:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:54:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:54:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:54:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:54:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:54:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:54:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:54:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:54:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:54:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:54:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:54:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:54:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:54:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:54:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:54:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:54:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:54:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:54:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:54:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:54:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946621139] [2024-11-10 07:54:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946621139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:54:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:54:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:54:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132914745] [2024-11-10 07:54:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:54:57,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:54:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:54:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:54:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:54:57,529 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:54:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:54:57,609 INFO L93 Difference]: Finished difference Result 144 states and 240 transitions. [2024-11-10 07:54:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:54:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-10 07:54:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:54:57,621 INFO L225 Difference]: With dead ends: 144 [2024-11-10 07:54:57,621 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 07:54:57,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:54:57,632 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:54:57,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:54:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 07:54:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 07:54:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:54:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-10 07:54:57,686 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 153 [2024-11-10 07:54:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:54:57,686 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-10 07:54:57,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:54:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-10 07:54:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 07:54:57,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:57,693 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:54:57,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1574241026, now seen corresponding path program 1 times [2024-11-10 07:54:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:54:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196027106] [2024-11-10 07:54:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:54:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:54:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:54:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:54:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:54:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:54:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:54:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:54:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:54:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:54:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:54:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:54:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:54:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:54:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:54:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:54:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:54:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:54:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:54:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:54:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:54:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:54:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:54:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:54:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:54:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:54:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196027106] [2024-11-10 07:54:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196027106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:54:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:54:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:54:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905239980] [2024-11-10 07:54:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:54:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:54:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:54:58,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:54:58,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:54:58,522 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:54:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:54:58,729 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-10 07:54:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:54:58,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-11-10 07:54:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:54:58,733 INFO L225 Difference]: With dead ends: 139 [2024-11-10 07:54:58,734 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 07:54:58,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:54:58,737 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:54:58,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 96 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:54:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 07:54:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 07:54:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:54:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2024-11-10 07:54:58,763 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 153 [2024-11-10 07:54:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:54:58,765 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-11-10 07:54:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:54:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-11-10 07:54:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 07:54:58,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:54:58,771 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:54:58,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:54:58,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:54:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 729769155, now seen corresponding path program 1 times [2024-11-10 07:54:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:54:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087262456] [2024-11-10 07:54:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:54:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:54:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:54:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:54:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:54:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:54:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:54:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:54:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:54:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:54:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:54:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:54:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:54:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:54:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:54:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:54:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:54:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:54:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:54:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 07:54:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:54:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:54:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 07:54:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:54:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:54:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:54:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087262456] [2024-11-10 07:54:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087262456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:54:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869078186] [2024-11-10 07:54:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:54:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:54:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:54:59,523 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:54:59,528 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:54:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:54:59,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 07:54:59,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:55:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 651 proven. 66 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-10 07:55:00,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:55:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 60 proven. 69 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-10 07:55:00,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869078186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:55:00,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:55:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2024-11-10 07:55:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916311302] [2024-11-10 07:55:00,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:55:00,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 07:55:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:55:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 07:55:00,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-10 07:55:00,682 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-10 07:55:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:55:01,816 INFO L93 Difference]: Finished difference Result 239 states and 327 transitions. [2024-11-10 07:55:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 07:55:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) Word has length 153 [2024-11-10 07:55:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:55:01,822 INFO L225 Difference]: With dead ends: 239 [2024-11-10 07:55:01,822 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 07:55:01,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 07:55:01,827 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 215 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:55:01,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 430 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:55:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 07:55:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2024-11-10 07:55:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:55:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2024-11-10 07:55:01,868 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 153 [2024-11-10 07:55:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:55:01,869 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2024-11-10 07:55:01,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 7 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-10 07:55:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2024-11-10 07:55:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 07:55:01,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:55:01,872 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:01,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:55:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:55:02,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:55:02,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:55:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash 662338369, now seen corresponding path program 1 times [2024-11-10 07:55:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:55:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661279818] [2024-11-10 07:55:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:55:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:55:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:55:02,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:55:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:55:02,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:55:02,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:55:02,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:55:02,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:55:02,313 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 07:55:02,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:55:02,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:55:02 BoogieIcfgContainer [2024-11-10 07:55:02,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:55:02,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:55:02,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:55:02,435 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:55:02,436 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:54:56" (3/4) ... [2024-11-10 07:55:02,439 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:55:02,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:55:02,440 INFO L158 Benchmark]: Toolchain (without parser) took 6648.66ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 88.9MB in the beginning and 130.0MB in the end (delta: -41.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,441 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:55:02,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.65ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 120.2MB in the end (delta: -31.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.58ms. Allocated memory is still 157.3MB. Free memory was 120.2MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,443 INFO L158 Benchmark]: Boogie Preprocessor took 60.46ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 109.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,444 INFO L158 Benchmark]: IcfgBuilder took 567.07ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 84.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,444 INFO L158 Benchmark]: TraceAbstraction took 5572.16ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 84.0MB in the beginning and 130.0MB in the end (delta: -46.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-10 07:55:02,444 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 205.5MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:55:02,445 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.65ms. Allocated memory is still 157.3MB. Free memory was 88.8MB in the beginning and 120.2MB in the end (delta: -31.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.58ms. Allocated memory is still 157.3MB. Free memory was 120.2MB in the beginning and 116.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.46ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 109.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 567.07ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 84.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5572.16ms. Allocated memory was 157.3MB in the beginning and 205.5MB in the end (delta: 48.2MB). Free memory was 84.0MB in the beginning and 130.0MB in the end (delta: -46.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 205.5MB. Free memory is still 130.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 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int var_1_4 = 256; [L24] unsigned short int var_1_6 = 10000; [L25] unsigned short int var_1_7 = 10000; [L26] unsigned short int var_1_8 = 128; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_11 = 64; [L30] unsigned char var_1_12 = 16; [L31] unsigned short int var_1_13 = 256; [L32] unsigned short int var_1_17 = 4; [L33] double var_1_18 = 64.2; [L34] unsigned short int var_1_19 = 53045; [L35] double var_1_20 = 1.75; [L36] double var_1_21 = 50.35; [L37] double var_1_22 = 5.5; [L38] double var_1_23 = 7.125; [L39] unsigned long int var_1_24 = 50; [L40] unsigned long int var_1_25 = 1907531378; [L41] unsigned long int var_1_26 = 8; [L42] unsigned char var_1_27 = 0; [L43] unsigned long int last_1_var_1_24 = 50; [L44] unsigned char last_1_var_1_27 = 0; VAL [isInitial=0, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] last_1_var_1_24 = var_1_24 [L126] last_1_var_1_27 = var_1_27 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L90] var_1_6 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_6 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L91] RET assume_abort_if_not(var_1_6 >= 8191) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L92] CALL assume_abort_if_not(var_1_6 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L92] RET assume_abort_if_not(var_1_6 <= 16384) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L93] var_1_7 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_7 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L94] RET assume_abort_if_not(var_1_7 >= 8192) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L95] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L95] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L96] var_1_8 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L97] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L98] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L98] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L99] var_1_9 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L100] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L101] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L101] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L103] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L104] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L104] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L107] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L107] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L108] var_1_18 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L109] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L110] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L110] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L111] var_1_19 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_19 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L112] RET assume_abort_if_not(var_1_19 >= 49150) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L113] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L113] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L114] var_1_21 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L115] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L116] var_1_22 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L117] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L118] var_1_23 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L119] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L120] var_1_25 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L121] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L122] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L122] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L137] RET updateVariables() [L138] CALL step() [L48] COND FALSE !(\read(last_1_var_1_27)) [L51] var_1_20 = var_1_22 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L53] COND TRUE (- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22))) [L54] var_1_27 = 0 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L56] EXPR var_1_8 << var_1_4 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L56] COND TRUE var_1_9 < (var_1_8 << var_1_4) [L57] var_1_10 = (var_1_11 + var_1_12) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L61] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=256, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L62] COND TRUE (var_1_10 <= var_1_10) || stepLocal_0 [L63] var_1_13 = ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L67] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, stepLocal_1=16383, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=50, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L68] COND FALSE !(stepLocal_1 == last_1_var_1_24) [L71] var_1_24 = (var_1_10 + (var_1_25 - var_1_11)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L73] signed long int stepLocal_2 = var_1_19 - var_1_7; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, stepLocal_2=49151, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L74] COND FALSE !(var_1_10 > stepLocal_2) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=128, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L77] COND TRUE var_1_20 < var_1_20 [L78] var_1_1 = ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=4, var_1_19=-1081933826, var_1_1=254, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L82] COND TRUE (var_1_20 / var_1_18) > var_1_20 [L83] var_1_17 = ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=49024, var_1_19=-1081933826, var_1_1=254, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=49024, var_1_19=-1081933826, var_1_1=254, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L129-L130] return ((((((((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11)))) && (((var_1_10 <= var_1_10) || var_1_27) ? (var_1_13 == ((unsigned short int) ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))))) : (var_1_13 == ((unsigned short int) var_1_10)))) && (((var_1_20 / var_1_18) > var_1_20) ? (var_1_17 == ((unsigned short int) ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7))) : 1)) && (last_1_var_1_27 ? (var_1_20 == ((double) (((((((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) > (16.6)) ? (((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) : (16.6))) - var_1_23))) : (var_1_20 == ((double) var_1_22)))) && ((var_1_7 == last_1_var_1_24) ? (var_1_24 == ((unsigned long int) (2332545940u - (1490203111u - var_1_11)))) : (var_1_24 == ((unsigned long int) (var_1_10 + (var_1_25 - var_1_11)))))) && ((var_1_10 > (var_1_19 - var_1_7)) ? (var_1_26 == ((unsigned long int) var_1_10)) : 1)) && (((- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22)))) ? (var_1_27 == ((unsigned char) 0)) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=49024, var_1_19=-1081933826, var_1_1=254, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=254, var_1_11=127, var_1_12=127, var_1_13=254, var_1_17=49024, var_1_19=-1081933826, var_1_1=254, var_1_20=2147483779, var_1_22=2147483779, var_1_24=2147483774, var_1_25=2147483647, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 262 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=3, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 2943 SizeOfPredicates, 4 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4871/5060 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:55:02,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.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 b9431012a5c272f0c5097cc7c5500cb3cd7eb3fc8e8dca0bbde243a270d6fb41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:55:04,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:55:04,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:55:04,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:55:04,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:55:04,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:55:04,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:55:04,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:55:04,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:55:04,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:55:04,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:55:04,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:55:04,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:55:04,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:55:04,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:55:04,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:55:04,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:55:04,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:55:04,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:55:04,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:55:04,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:55:04,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:55:04,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:55:04,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:55:04,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:55:04,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:55:04,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:55:04,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:55:04,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:55:04,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:55:04,941 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:55:04,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:55:04,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:55:04,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:55:04,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:55:04,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:55:04,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:55:04,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:55:04,943 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:55:04,943 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:55:04,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:55:04,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:55:04,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:55:04,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:55:04,945 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 -> b9431012a5c272f0c5097cc7c5500cb3cd7eb3fc8e8dca0bbde243a270d6fb41 [2024-11-10 07:55:05,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:55:05,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:55:05,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:55:05,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:55:05,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:55:05,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:55:06,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:55:07,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:55:07,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:55:07,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565cb794e/29cdb728b9684d4099379660f487b773/FLAG7a1aea68a [2024-11-10 07:55:07,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565cb794e/29cdb728b9684d4099379660f487b773 [2024-11-10 07:55:07,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:55:07,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:55:07,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:55:07,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:55:07,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:55:07,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d33cba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07, skipping insertion in model container [2024-11-10 07:55:07,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:55:07,327 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_50-while_file-22.i[915,928] [2024-11-10 07:55:07,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:55:07,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:55:07,443 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_50-while_file-22.i[915,928] [2024-11-10 07:55:07,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:55:07,508 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:55:07,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07 WrapperNode [2024-11-10 07:55:07,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:55:07,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:55:07,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:55:07,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:55:07,517 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:55:07" (1/1) ... [2024-11-10 07:55:07,535 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:55:07" (1/1) ... [2024-11-10 07:55:07,568 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-10 07:55:07,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:55:07,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:55:07,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:55:07,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:55:07,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,598 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:55:07,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:55:07,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:55:07,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:55:07,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:55:07,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (1/1) ... [2024-11-10 07:55:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:55:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:55:07,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:55:07,664 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:55:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:55:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:55:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:55:07,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:55:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:55:07,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:55:07,801 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:55:07,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:55:20,006 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 07:55:20,006 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:55:20,023 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:55:20,023 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:55:20,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:55:20 BoogieIcfgContainer [2024-11-10 07:55:20,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:55:20,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:55:20,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:55:20,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:55:20,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:55:07" (1/3) ... [2024-11-10 07:55:20,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5d9973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:55:20, skipping insertion in model container [2024-11-10 07:55:20,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:55:07" (2/3) ... [2024-11-10 07:55:20,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5d9973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:55:20, skipping insertion in model container [2024-11-10 07:55:20,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:55:20" (3/3) ... [2024-11-10 07:55:20,033 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-22.i [2024-11-10 07:55:20,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:55:20,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:55:20,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:55:20,120 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;@5ff477d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:55:20,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:55:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:55:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:55:20,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:55:20,141 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:55:20,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:55:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2142957031, now seen corresponding path program 1 times [2024-11-10 07:55:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:55:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373123159] [2024-11-10 07:55:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:55:20,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:55:20,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:55:20,162 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:55:20,163 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:55:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:55:21,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:55:21,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:55:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-10 07:55:21,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:55:21,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:55:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373123159] [2024-11-10 07:55:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373123159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:55:21,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:55:21,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:55:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280449354] [2024-11-10 07:55:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:55:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:55:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:55:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:55:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:55:21,183 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:55:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:55:21,209 INFO L93 Difference]: Finished difference Result 130 states and 220 transitions. [2024-11-10 07:55:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:55:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-10 07:55:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:55:21,217 INFO L225 Difference]: With dead ends: 130 [2024-11-10 07:55:21,217 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 07:55:21,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:55:21,223 INFO L432 NwaCegarLoop]: 92 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, 92 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:55:21,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:55:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 07:55:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 07:55:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:55:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-11-10 07:55:21,269 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 150 [2024-11-10 07:55:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:55:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-11-10 07:55:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:55:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-11-10 07:55:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:55:21,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:55:21,273 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,296 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:55:21,474 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:55:21,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:55:21,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:55:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2091843669, now seen corresponding path program 1 times [2024-11-10 07:55:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:55:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341611347] [2024-11-10 07:55:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:55:21,477 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:55:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:55:21,480 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:55:21,481 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:55:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:55:22,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:55:22,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:55:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-10 07:55:32,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:55:35,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:55:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341611347] [2024-11-10 07:55:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341611347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:55:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833173594] [2024-11-10 07:55:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:55:35,550 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 07:55:35,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 07:55:35,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 07:55:35,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 07:55:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:55:37,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 07:55:37,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:55:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-10 07:55:43,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:55:45,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1833173594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:55:45,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:55:45,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2024-11-10 07:55:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311058203] [2024-11-10 07:55:45,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:55:45,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 07:55:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:55:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 07:55:45,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:55:45,225 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-10 07:55:54,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:55:58,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:56:02,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:56:07,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:56:11,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:56:15,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:56:19,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []