./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.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 c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:27:36,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:27:36,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:27:36,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:27:36,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:27:36,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:27:36,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:27:36,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:27:36,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:27:36,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:27:36,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:27:36,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:27:36,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:27:36,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:27:36,577 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:27:36,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:27:36,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:27:36,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:27:36,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:27:36,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:27:36,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:27:36,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:27:36,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:27:36,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:27:36,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:27:36,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:27:36,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:27:36,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:27:36,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:27:36,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:27:36,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:27:36,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:27:36,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:27:36,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:27:36,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:27:36,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:27:36,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:27:36,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:27:36,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:27:36,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:27:36,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:27:36,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:27:36,593 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 -> c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 [2024-10-13 04:27:36,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:27:36,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:27:36,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:27:36,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:27:36,890 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:27:36,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:27:38,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:27:38,629 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:27:38,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:27:38,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b4a392d/61a55d6063be4939b702f48ac80da2b1/FLAG115afdf3c [2024-10-13 04:27:38,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b4a392d/61a55d6063be4939b702f48ac80da2b1 [2024-10-13 04:27:38,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:27:38,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:27:38,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:27:38,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:27:38,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:27:38,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:27:38" (1/1) ... [2024-10-13 04:27:38,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2761dc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:38, skipping insertion in model container [2024-10-13 04:27:38,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:27:38" (1/1) ... [2024-10-13 04:27:38,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:27:38,911 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i[915,928] [2024-10-13 04:27:38,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:27:38,986 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:27:39,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i[915,928] [2024-10-13 04:27:39,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:27:39,047 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:27:39,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39 WrapperNode [2024-10-13 04:27:39,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:27:39,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:27:39,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:27:39,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:27:39,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,106 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-13 04:27:39,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:27:39,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:27:39,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:27:39,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:27:39,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:27:39,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:27:39,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:27:39,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:27:39,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:27:39,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (1/1) ... [2024-10-13 04:27:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:27:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:27:39,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:27:39,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:27:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:27:39,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:27:39,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:27:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:27:39,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:27:39,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:27:39,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:27:39,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:27:39,775 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 04:27:39,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:27:39,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:27:39,822 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:27:39,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:27:39 BoogieIcfgContainer [2024-10-13 04:27:39,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:27:39,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:27:39,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:27:39,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:27:39,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:27:38" (1/3) ... [2024-10-13 04:27:39,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418dd10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:27:39, skipping insertion in model container [2024-10-13 04:27:39,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:39" (2/3) ... [2024-10-13 04:27:39,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418dd10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:27:39, skipping insertion in model container [2024-10-13 04:27:39,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:27:39" (3/3) ... [2024-10-13 04:27:39,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:27:39,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:27:39,846 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:27:39,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:27:39,906 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;@22c6e30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:27:39,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:27:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:27:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:27:39,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:27:39,927 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:27:39,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:27:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:27:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash 628465278, now seen corresponding path program 1 times [2024-10-13 04:27:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:27:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40393317] [2024-10-13 04:27:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:27:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:27:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:27:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:27:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:27:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:27:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:27:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:27:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:27:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:27:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:27:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:27:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:27:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:27:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:27:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:27:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:27:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:27:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:27:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:27:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 04:27:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:27:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40393317] [2024-10-13 04:27:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40393317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:27:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:27:40,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:27:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88653591] [2024-10-13 04:27:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:27:40,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:27:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:27:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:27:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:27:40,480 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:27:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:27:40,532 INFO L93 Difference]: Finished difference Result 107 states and 185 transitions. [2024-10-13 04:27:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:27:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-13 04:27:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:27:40,544 INFO L225 Difference]: With dead ends: 107 [2024-10-13 04:27:40,545 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:27:40,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:27:40,556 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:27:40,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:27:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:27:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:27:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:27:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-13 04:27:40,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-13 04:27:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:27:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-13 04:27:40,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:27:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-13 04:27:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:27:40,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:27:40,606 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:27:40,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:27:40,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:27:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:27:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash 878126714, now seen corresponding path program 1 times [2024-10-13 04:27:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:27:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035392183] [2024-10-13 04:27:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:27:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:27:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:27:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:27:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:27:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:27:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:27:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:27:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:27:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:27:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:27:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:27:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:27:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:27:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:27:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:27:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:27:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:27:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:27:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:27:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:27:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 04:27:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:27:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035392183] [2024-10-13 04:27:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035392183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:27:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:27:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:27:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051728808] [2024-10-13 04:27:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:27:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:27:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:27:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:27:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:27:41,260 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 04:27:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:27:41,366 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-13 04:27:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:27:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-13 04:27:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:27:41,373 INFO L225 Difference]: With dead ends: 128 [2024-10-13 04:27:41,373 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 04:27:41,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:27:41,378 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:27:41,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 223 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:27:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 04:27:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-13 04:27:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:27:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-13 04:27:41,405 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-13 04:27:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:27:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-13 04:27:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 04:27:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-13 04:27:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:27:41,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:27:41,411 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:27:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:27:41,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:27:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:27:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 761568818, now seen corresponding path program 1 times [2024-10-13 04:27:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:27:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016502183] [2024-10-13 04:27:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:27:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:27:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:27:41,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671659292] [2024-10-13 04:27:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:27:41,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:27:41,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:27:41,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:27:41,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:27:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:27:41,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:27:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:27:41,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:27:41,978 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:27:41,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:27:41,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:27:42,181 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-10-13 04:27:42,186 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:27:42,304 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:27:42,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:27:42 BoogieIcfgContainer [2024-10-13 04:27:42,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:27:42,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:27:42,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:27:42,308 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:27:42,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:27:39" (3/4) ... [2024-10-13 04:27:42,311 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:27:42,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:27:42,314 INFO L158 Benchmark]: Toolchain (without parser) took 3652.44ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 85.1MB in the beginning and 161.2MB in the end (delta: -76.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:27:42,315 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:27:42,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.04ms. Allocated memory is still 153.1MB. Free memory was 85.0MB in the beginning and 112.8MB in the end (delta: -27.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-13 04:27:42,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.44ms. Allocated memory is still 153.1MB. Free memory was 112.8MB in the beginning and 109.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:27:42,316 INFO L158 Benchmark]: Boogie Preprocessor took 71.50ms. Allocated memory is still 153.1MB. Free memory was 109.0MB in the beginning and 104.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:27:42,317 INFO L158 Benchmark]: RCFGBuilder took 642.98ms. Allocated memory is still 153.1MB. Free memory was 103.6MB in the beginning and 79.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 04:27:42,319 INFO L158 Benchmark]: TraceAbstraction took 2482.24ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 78.4MB in the beginning and 161.2MB in the end (delta: -82.8MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-10-13 04:27:42,319 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 197.1MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:27:42,320 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.04ms. Allocated memory is still 153.1MB. Free memory was 85.0MB in the beginning and 112.8MB in the end (delta: -27.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.44ms. Allocated memory is still 153.1MB. Free memory was 112.8MB in the beginning and 109.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.50ms. Allocated memory is still 153.1MB. Free memory was 109.0MB in the beginning and 104.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 642.98ms. Allocated memory is still 153.1MB. Free memory was 103.6MB in the beginning and 79.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2482.24ms. Allocated memory was 153.1MB in the beginning and 197.1MB in the end (delta: 44.0MB). Free memory was 78.4MB in the beginning and 161.2MB in the end (delta: -82.8MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 197.1MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned long int last_1_var_1_1 = 16; [L39] signed char last_1_var_1_9 = 10; [L40] unsigned short int last_1_var_1_12 = 10000; [L41] double last_1_var_1_20 = 1.5; [L42] unsigned char last_1_var_1_22 = 5; [L43] signed short int last_1_var_1_25 = 10; [L137] isInitial = 1 [L138] FCALL initially() [L139] int k_loop; [L140] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L140] COND TRUE k_loop < 1 [L141] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_20 = var_1_20 [L129] last_1_var_1_22 = var_1_22 [L130] last_1_var_1_25 = var_1_25 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L100] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L102] var_1_11 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L103] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L104] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L109] var_1_18 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L111] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && 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_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && 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_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L114] var_1_23 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L115] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L116] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L116] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L117] var_1_24 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L118] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L119] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L119] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L120] var_1_26 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L121] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L122] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L142] RET updateVariables() [L143] CALL step() [L47] COND FALSE !(! var_1_10) [L54] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L56] unsigned char stepLocal_2 = var_1_10; [L57] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L58] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=7, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L59] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L62] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L65] unsigned long int stepLocal_5 = last_1_var_1_1; [L66] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L67] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, stepLocal_5=16, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L68] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L79] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L81] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L82] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=7] [L84] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L85] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L89] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=2, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L90] COND TRUE stepLocal_0 == var_1_25 [L91] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L143] RET step() [L144] CALL, EXPR property() [L133-L134] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=7, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 159 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:27:42,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.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 c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:27:44,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:27:44,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:27:44,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:27:44,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:27:44,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:27:44,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:27:44,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:27:44,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:27:44,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:27:44,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:27:44,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:27:44,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:27:44,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:27:44,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:27:44,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:27:44,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:27:44,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:27:44,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:27:44,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:27:44,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:27:44,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:27:44,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:27:44,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:27:44,666 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:27:44,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:27:44,667 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:27:44,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:27:44,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:27:44,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:27:44,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:27:44,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:27:44,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:27:44,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:27:44,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:27:44,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:27:44,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:27:44,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:27:44,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:27:44,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:27:44,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:27:44,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:27:44,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:27:44,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:27:44,673 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:27:44,673 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 -> c25e21c50fc3f19586705dbabc58d5e825823fcb59fbd002ae657c0fa41f3444 [2024-10-13 04:27:45,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:27:45,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:27:45,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:27:45,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:27:45,056 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:27:45,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:27:46,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:27:46,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:27:46,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:27:46,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5fbffd8/7dffb2c1ab154be18657835db85c5787/FLAGb739a4fea [2024-10-13 04:27:47,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5fbffd8/7dffb2c1ab154be18657835db85c5787 [2024-10-13 04:27:47,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:27:47,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:27:47,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:27:47,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:27:47,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:27:47,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66aba8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47, skipping insertion in model container [2024-10-13 04:27:47,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:27:47,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i[915,928] [2024-10-13 04:27:47,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:27:47,446 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:27:47,461 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-26.i[915,928] [2024-10-13 04:27:47,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:27:47,521 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:27:47,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47 WrapperNode [2024-10-13 04:27:47,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:27:47,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:27:47,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:27:47,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:27:47,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,583 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-13 04:27:47,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:27:47,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:27:47,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:27:47,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:27:47,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,623 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:27:47,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:27:47,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:27:47,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:27:47,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:27:47,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (1/1) ... [2024-10-13 04:27:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:27:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:27:47,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:27:47,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:27:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:27:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:27:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:27:47,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:27:47,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:27:47,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:27:47,865 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:27:47,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:28:01,134 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 04:28:01,134 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:28:01,176 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:28:01,177 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:28:01,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:28:01 BoogieIcfgContainer [2024-10-13 04:28:01,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:28:01,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:28:01,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:28:01,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:28:01,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:27:47" (1/3) ... [2024-10-13 04:28:01,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fcf5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:28:01, skipping insertion in model container [2024-10-13 04:28:01,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:27:47" (2/3) ... [2024-10-13 04:28:01,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fcf5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:28:01, skipping insertion in model container [2024-10-13 04:28:01,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:28:01" (3/3) ... [2024-10-13 04:28:01,190 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-26.i [2024-10-13 04:28:01,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:28:01,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:28:01,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:28:01,280 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;@6915fe11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:28:01,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:28:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:28:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:28:01,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:28:01,297 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:28:01,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:28:01,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:28:01,303 INFO L85 PathProgramCache]: Analyzing trace with hash 628465278, now seen corresponding path program 1 times [2024-10-13 04:28:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:28:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650537727] [2024-10-13 04:28:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:28:01,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:28:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:28:01,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:28:01,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:28:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:28:02,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:28:02,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:28:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 04:28:02,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:28:02,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:28:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650537727] [2024-10-13 04:28:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650537727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:28:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:28:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:28:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174611779] [2024-10-13 04:28:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:28:02,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:28:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:28:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:28:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:28:02,256 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:28:06,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:28:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:28:06,707 INFO L93 Difference]: Finished difference Result 107 states and 185 transitions. [2024-10-13 04:28:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:28:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-13 04:28:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:28:06,717 INFO L225 Difference]: With dead ends: 107 [2024-10-13 04:28:06,717 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:28:06,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:28:06,722 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:28:06,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 04:28:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:28:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:28:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:28:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-13 04:28:06,772 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-13 04:28:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:28:06,773 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-13 04:28:06,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:28:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-13 04:28:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 04:28:06,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:28:06,776 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:28:06,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:28:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:28:06,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:28:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:28:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 878126714, now seen corresponding path program 1 times [2024-10-13 04:28:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:28:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975629170] [2024-10-13 04:28:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:28:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:28:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:28:06,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:28:06,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:28:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:28:07,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:28:07,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:28:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-13 04:28:10,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:28:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 04:28:11,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:28:11,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975629170] [2024-10-13 04:28:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975629170] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 04:28:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:28:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-13 04:28:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298678605] [2024-10-13 04:28:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:28:11,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:28:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:28:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:28:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:28:11,866 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 04:28:16,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:28:20,879 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-10-13 04:28:24,887 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-10-13 04:28:28,900 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-10-13 04:28:32,907 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-10-13 04:28:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:28:33,090 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-13 04:28:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:28:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-13 04:28:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:28:33,093 INFO L225 Difference]: With dead ends: 128 [2024-10-13 04:28:33,093 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 04:28:33,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:28:33,094 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:28:33,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 233 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2024-10-13 04:28:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 04:28:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-13 04:28:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:28:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-13 04:28:33,110 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-13 04:28:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:28:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-13 04:28:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 04:28:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-13 04:28:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:28:33,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:28:33,114 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:28:33,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:28:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:28:33,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:28:33,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:28:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 761568818, now seen corresponding path program 1 times [2024-10-13 04:28:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:28:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173627602] [2024-10-13 04:28:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:28:33,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:28:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:28:33,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:28:33,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:28:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:28:34,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 04:28:34,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:29:02,580 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:29:10,900 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)