./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.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 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:21:08,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:21:08,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:21:08,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:21:08,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:21:08,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:21:08,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:21:08,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:21:08,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:21:08,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:21:08,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:21:08,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:21:08,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:21:08,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:21:08,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:21:08,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:21:08,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:21:08,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:21:08,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:21:08,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:21:08,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:21:08,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:21:08,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:21:08,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:21:08,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:21:08,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:21:08,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:21:08,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:21:08,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:21:08,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:21:08,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:21:08,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:21:08,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:08,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:21:08,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:21:08,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:21:08,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:21:08,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:21:08,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:21:08,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:21:08,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:21:08,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:21:08,182 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 -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2024-11-10 03:21:08,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:21:08,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:21:08,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:21:08,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:21:08,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:21:08,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-11-10 03:21:09,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:21:10,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:21:10,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-11-10 03:21:10,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c38b6089/bd01a140a08b4d94a284fac3c718445c/FLAG094014afc [2024-11-10 03:21:10,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c38b6089/bd01a140a08b4d94a284fac3c718445c [2024-11-10 03:21:10,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:21:10,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:21:10,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:10,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:21:10,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:21:10,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48435afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10, skipping insertion in model container [2024-11-10 03:21:10,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:21:10,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-11-10 03:21:10,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:10,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:21:10,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-11-10 03:21:10,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:10,505 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:21:10,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10 WrapperNode [2024-11-10 03:21:10,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:10,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:10,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:21:10,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:21:10,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,583 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-10 03:21:10,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:10,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:21:10,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:21:10,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:21:10,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:21:10,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:21:10,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:21:10,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:21:10,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:21:10,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:10,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:10,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:21:10,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:21:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:21:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:21:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:21:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:21:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:21:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:21:10,822 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:21:10,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:21:11,236 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:21:11,236 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:21:11,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:21:11,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:21:11,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:11 BoogieIcfgContainer [2024-11-10 03:21:11,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:21:11,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:21:11,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:21:11,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:21:11,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:10" (1/3) ... [2024-11-10 03:21:11,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3600a8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:11, skipping insertion in model container [2024-11-10 03:21:11,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10" (2/3) ... [2024-11-10 03:21:11,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3600a8f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:11, skipping insertion in model container [2024-11-10 03:21:11,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:11" (3/3) ... [2024-11-10 03:21:11,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2024-11-10 03:21:11,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:21:11,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:21:11,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:21:11,355 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;@1511b343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:21:11,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:21:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:21:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 03:21:11,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:11,380 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:11,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 576468904, now seen corresponding path program 1 times [2024-11-10 03:21:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359026558] [2024-11-10 03:21:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:21:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:21:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:21:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:21:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:21:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:21:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:21:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:21:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:21:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:21:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:21:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:21:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:21:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:21:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:21:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:21:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:21:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:21:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:21:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:21:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:21:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:21:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:21:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:21:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:21:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 03:21:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:11,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359026558] [2024-11-10 03:21:11,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359026558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:21:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:21:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:21:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169675866] [2024-11-10 03:21:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:21:11,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:21:11,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:11,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:21:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:11,942 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:21:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:11,978 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-10 03:21:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:21:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 158 [2024-11-10 03:21:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:11,989 INFO L225 Difference]: With dead ends: 136 [2024-11-10 03:21:11,990 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 03:21:11,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:12,001 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:12,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:21:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 03:21:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 03:21:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:21:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-10 03:21:12,052 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 158 [2024-11-10 03:21:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:12,052 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-10 03:21:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:21:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-10 03:21:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 03:21:12,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:12,059 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:21:12,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash -299459159, now seen corresponding path program 1 times [2024-11-10 03:21:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472910961] [2024-11-10 03:21:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:21:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435045493] [2024-11-10 03:21:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:12,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:21:12,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:21:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:12,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 03:21:12,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-10 03:21:13,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472910961] [2024-11-10 03:21:18,464 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:21:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435045493] [2024-11-10 03:21:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435045493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:21:18,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:21:18,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-10 03:21:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716779491] [2024-11-10 03:21:18,466 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:18,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 03:21:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 03:21:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=272, Unknown=1, NotChecked=0, Total=380 [2024-11-10 03:21:18,469 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:21:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:19,722 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2024-11-10 03:21:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 03:21:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 158 [2024-11-10 03:21:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:19,729 INFO L225 Difference]: With dead ends: 255 [2024-11-10 03:21:19,730 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 03:21:19,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=366, Invalid=893, Unknown=1, NotChecked=0, Total=1260 [2024-11-10 03:21:19,732 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 187 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:19,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 484 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:21:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 03:21:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2024-11-10 03:21:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 76 states have internal predecessors, (88), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 03:21:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-10 03:21:19,759 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 158 [2024-11-10 03:21:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:19,760 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-10 03:21:19,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:21:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-10 03:21:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 03:21:19,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:19,763 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:19,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:21:19,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:19,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2045708508, now seen corresponding path program 1 times [2024-11-10 03:21:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:19,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55115209] [2024-11-10 03:21:19,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:19,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:21:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125332909] [2024-11-10 03:21:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:20,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:21:20,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:21:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:20,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:21:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:20,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:21:20,558 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:21:20,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:21:20,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:21:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 03:21:20,767 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:21:20,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:21:20,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:21:20 BoogieIcfgContainer [2024-11-10 03:21:20,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:21:20,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:21:20,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:21:20,899 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:21:20,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:11" (3/4) ... [2024-11-10 03:21:20,902 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:21:20,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:21:20,904 INFO L158 Benchmark]: Toolchain (without parser) took 10772.52ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 104.9MB in the beginning and 111.8MB in the end (delta: -6.9MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,905 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:20,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.02ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 89.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.45ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,906 INFO L158 Benchmark]: Boogie Preprocessor took 83.03ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 79.8MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,906 INFO L158 Benchmark]: IcfgBuilder took 587.16ms. Allocated memory is still 159.4MB. Free memory was 79.8MB in the beginning and 117.1MB in the end (delta: -37.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,907 INFO L158 Benchmark]: TraceAbstraction took 9638.39ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 115.8MB in the beginning and 112.9MB in the end (delta: 2.9MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-11-10 03:21:20,907 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 209.7MB. Free memory was 112.9MB in the beginning and 111.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:20,909 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.20ms. Allocated memory is still 159.4MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.02ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 89.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.45ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.03ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 79.8MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 587.16ms. Allocated memory is still 159.4MB. Free memory was 79.8MB in the beginning and 117.1MB in the end (delta: -37.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9638.39ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 115.8MB in the beginning and 112.9MB in the end (delta: 2.9MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 209.7MB. Free memory was 112.9MB in the beginning and 111.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 100.25; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 4.8; [L29] signed char var_1_8 = 64; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 0; [L32] signed char var_1_11 = -10; [L33] signed char var_1_12 = 64; [L34] float var_1_13 = 1.6; [L35] float var_1_14 = 3.5; [L36] unsigned char var_1_15 = 8; [L37] unsigned char var_1_16 = 4; [L38] unsigned short int var_1_17 = 2; [L39] unsigned short int var_1_18 = 10000; [L40] unsigned short int var_1_19 = 5; [L41] signed short int var_1_20 = 4; [L42] unsigned long int var_1_21 = 5; [L43] signed char var_1_22 = -32; [L44] unsigned long int var_1_23 = 0; VAL [isInitial=0, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_2=401/4, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L90] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] var_1_5 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] var_1_11 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] var_1_12 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] var_1_16 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] var_1_18 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] var_1_19 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] var_1_21 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET updateVariables() [L141] CALL step() [L48] COND TRUE (- var_1_2) > 31.9f [L49] var_1_1 = ((var_1_3 || var_1_4) && var_1_5) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L53] COND FALSE !((127.35 + var_1_2) <= var_1_7) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] COND TRUE var_1_9 > var_1_10 [L59] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L61] COND FALSE !((! var_1_5) || (var_1_12 < var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L68] COND TRUE \read(var_1_3) [L69] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=2, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_3 || (var_1_9 < var_1_15) [L72] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L76] COND FALSE !(((var_1_17 / var_1_18) * var_1_19) < -10) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L79] COND TRUE ! (var_1_21 <= var_1_10) [L80] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L85] var_1_22 = 1 [L86] var_1_23 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return ((((((((((- var_1_2) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_3 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_2) <= var_1_7) ? ((4.5 <= (var_1_7 * var_1_2)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_9 > var_1_10) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < var_1_8)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_3 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_3 || (var_1_9 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_17 / var_1_18) * var_1_19) < -10) ? (var_1_20 == ((signed short int) ((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))))) : ((! (var_1_21 <= var_1_10)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=-2, var_1_16=-2, var_1_17=8192, var_1_18=-57344, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=254, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 585 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 204 mSDtfsCounter, 682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=2, InterpolantAutomatonStates: 34, 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, 67 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 984 SizeOfPredicates, 5 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2367/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:21:20,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.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 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:21:23,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:21:23,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:21:23,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:21:23,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:21:23,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:21:23,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:21:23,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:21:23,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:21:23,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:21:23,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:21:23,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:21:23,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:21:23,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:21:23,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:21:23,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:21:23,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:21:23,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:21:23,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:21:23,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:21:23,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:21:23,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:21:23,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:21:23,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:21:23,322 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:21:23,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:21:23,323 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:21:23,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:21:23,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:21:23,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:21:23,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:21:23,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:21:23,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:21:23,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:21:23,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:23,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:21:23,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:21:23,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:21:23,329 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:21:23,329 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:21:23,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:21:23,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:21:23,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:21:23,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:21:23,330 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 -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2024-11-10 03:21:23,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:21:23,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:21:23,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:21:23,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:21:23,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:21:23,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-11-10 03:21:25,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:21:25,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:21:25,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-11-10 03:21:25,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28632c069/9689759211ce42f8a7f9b1d3c40ab7f2/FLAG2132c9f77 [2024-11-10 03:21:25,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28632c069/9689759211ce42f8a7f9b1d3c40ab7f2 [2024-11-10 03:21:25,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:21:25,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:21:25,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:25,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:21:25,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:21:25,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:25" (1/1) ... [2024-11-10 03:21:25,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1851c0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:25, skipping insertion in model container [2024-11-10 03:21:25,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:25" (1/1) ... [2024-11-10 03:21:25,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:21:25,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-11-10 03:21:26,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:26,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:21:26,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-11-10 03:21:26,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:26,159 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:21:26,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26 WrapperNode [2024-11-10 03:21:26,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:26,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:26,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:21:26,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:21:26,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,219 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-10 03:21:26,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:26,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:21:26,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:21:26,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:21:26,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:21:26,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:21:26,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:21:26,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:21:26,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:21:26,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 03:21:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:26,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:26,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:21:26,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:21:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:21:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:21:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:21:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:21:26,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:21:26,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:21:26,486 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:21:26,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:21:38,735 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:21:38,736 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:21:38,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:21:38,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:21:38,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:38 BoogieIcfgContainer [2024-11-10 03:21:38,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:21:38,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:21:38,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:21:38,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:21:38,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:25" (1/3) ... [2024-11-10 03:21:38,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c7fc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:38, skipping insertion in model container [2024-11-10 03:21:38,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (2/3) ... [2024-11-10 03:21:38,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c7fc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:38, skipping insertion in model container [2024-11-10 03:21:38,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:38" (3/3) ... [2024-11-10 03:21:38,767 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2024-11-10 03:21:38,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:21:38,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:21:38,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:21:38,870 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;@5db60eca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:21:38,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:21:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:21:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 03:21:38,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:38,891 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:38,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:38,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 576468904, now seen corresponding path program 1 times [2024-11-10 03:21:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346384935] [2024-11-10 03:21:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:38,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:38,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:21:38,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:21:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:39,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:21:39,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-10 03:21:39,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:21:39,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:21:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346384935] [2024-11-10 03:21:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346384935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:21:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:21:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:21:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138644654] [2024-11-10 03:21:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:21:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:21:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:21:39,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:21:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:39,509 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:21:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:39,539 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-10 03:21:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:21:39,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 158 [2024-11-10 03:21:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:39,549 INFO L225 Difference]: With dead ends: 136 [2024-11-10 03:21:39,549 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 03:21:39,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:39,558 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:39,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:21:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 03:21:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 03:21:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:21:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-10 03:21:39,603 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 158 [2024-11-10 03:21:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:39,603 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-10 03:21:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:21:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-10 03:21:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 03:21:39,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:39,607 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:39,623 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:21:39,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:39,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:39,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -299459159, now seen corresponding path program 1 times [2024-11-10 03:21:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079341142] [2024-11-10 03:21:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:39,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:21:39,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:21:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:40,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 03:21:40,203 INFO L278 TraceCheckSpWp]: Computing forward predicates...