./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercode_fillercodestructure_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:33:28,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:33:29,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:33:29,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:33:29,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:33:29,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:33:29,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:33:29,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:33:29,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:33:29,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:33:29,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:33:29,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:33:29,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:33:29,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:33:29,091 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:33:29,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:33:29,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:33:29,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:33:29,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:33:29,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:33:29,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:33:29,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:33:29,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:33:29,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:33:29,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:33:29,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:33:29,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:33:29,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:33:29,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:29,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:33:29,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:33:29,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:33:29,099 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-11-12 04:33:29,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:33:29,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:33:29,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:33:29,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:33:29,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:33:29,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:30,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:33:30,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:33:30,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:30,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af90b89b/9a06e89909304c2d821c7b251ba9c835/FLAG64893d22e [2024-11-12 04:33:30,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af90b89b/9a06e89909304c2d821c7b251ba9c835 [2024-11-12 04:33:30,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:33:30,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:33:30,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:30,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:33:30,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:33:30,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:30" (1/1) ... [2024-11-12 04:33:30,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5773a343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:30, skipping insertion in model container [2024-11-12 04:33:30,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:30" (1/1) ... [2024-11-12 04:33:30,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:33:30,959 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_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-12 04:33:31,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:31,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:33:31,029 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_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-12 04:33:31,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:31,079 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:33:31,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31 WrapperNode [2024-11-12 04:33:31,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:31,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:31,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:33:31,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:33:31,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,135 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-12 04:33:31,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:31,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:33:31,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:33:31,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:33:31,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,181 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-12 04:33:31,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:33:31,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:33:31,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:33:31,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:33:31,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (1/1) ... [2024-11-12 04:33:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:31,248 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-12 04:33:31,251 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-12 04:33:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:33:31,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:33:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:33:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:33:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:33:31,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:33:31,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:33:31,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:33:31,640 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:33:31,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:33:31,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:33:31,650 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:33:31,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:31 BoogieIcfgContainer [2024-11-12 04:33:31,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:33:31,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:33:31,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:33:31,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:33:31,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:33:30" (1/3) ... [2024-11-12 04:33:31,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4967f5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:31, skipping insertion in model container [2024-11-12 04:33:31,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:31" (2/3) ... [2024-11-12 04:33:31,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4967f5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:31, skipping insertion in model container [2024-11-12 04:33:31,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:31" (3/3) ... [2024-11-12 04:33:31,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:31,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:33:31,669 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:33:31,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:33:31,727 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;@6e454c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:33:31,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:33:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 04:33:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 04:33:31,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:31,743 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:31,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:31,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 760726303, now seen corresponding path program 1 times [2024-11-12 04:33:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326465752] [2024-11-12 04:33:31,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:33:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:33:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:33:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:33:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:33:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:33:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:33:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:33:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:33:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:33:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:33:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 04:33:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:33:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 04:33:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 04:33:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 04:33:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 04:33:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 04:33:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 04:33:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:33:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 04:33:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326465752] [2024-11-12 04:33:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326465752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:32,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:33:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679639505] [2024-11-12 04:33:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:32,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:33:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:33:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:33:32,130 INFO L87 Difference]: Start difference. First operand has 77 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 04:33:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:32,178 INFO L93 Difference]: Finished difference Result 147 states and 253 transitions. [2024-11-12 04:33:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:33:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-11-12 04:33:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:32,212 INFO L225 Difference]: With dead ends: 147 [2024-11-12 04:33:32,212 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 04:33:32,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-12 04:33:32,221 INFO L435 NwaCegarLoop]: 109 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, 109 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-12 04:33:32,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 04:33:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 04:33:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 04:33:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-12 04:33:32,264 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 170 [2024-11-12 04:33:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-12 04:33:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 04:33:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-12 04:33:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 04:33:32,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:32,270 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:32,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:33:32,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash -673320403, now seen corresponding path program 1 times [2024-11-12 04:33:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281406453] [2024-11-12 04:33:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:33:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:33:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:33:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:33:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:33:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:33:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:33:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:33:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:33:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:33:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:33:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 04:33:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:33:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 04:33:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 04:33:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 04:33:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 04:33:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 04:33:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 04:33:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:33:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 04:33:32,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:32,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281406453] [2024-11-12 04:33:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281406453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:32,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:33:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864201678] [2024-11-12 04:33:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:32,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:33:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:33:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:33:32,803 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:33,010 INFO L93 Difference]: Finished difference Result 223 states and 332 transitions. [2024-11-12 04:33:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:33:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2024-11-12 04:33:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:33,015 INFO L225 Difference]: With dead ends: 223 [2024-11-12 04:33:33,016 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 04:33:33,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:33:33,017 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 84 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:33,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 308 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:33:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 04:33:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2024-11-12 04:33:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 86 states have internal predecessors, (106), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 04:33:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-11-12 04:33:33,054 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 170 [2024-11-12 04:33:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:33,054 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-11-12 04:33:33,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-11-12 04:33:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 04:33:33,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:33,058 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:33,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:33:33,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:33,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -817549831, now seen corresponding path program 1 times [2024-11-12 04:33:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158009371] [2024-11-12 04:33:33,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:33:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:33:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:33:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:33:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:33:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:33:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:33:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:33:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:33:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:33:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:33:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 04:33:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:33:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 04:33:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 04:33:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 04:33:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 04:33:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 04:33:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 04:33:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:33:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 04:33:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158009371] [2024-11-12 04:33:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158009371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:33:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002091059] [2024-11-12 04:33:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:33,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:33:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:33:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:33,283 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:33,337 INFO L93 Difference]: Finished difference Result 423 states and 636 transitions. [2024-11-12 04:33:33,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:33:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-12 04:33:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:33,343 INFO L225 Difference]: With dead ends: 423 [2024-11-12 04:33:33,344 INFO L226 Difference]: Without dead ends: 283 [2024-11-12 04:33:33,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:33:33,349 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:33,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:33:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-12 04:33:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2024-11-12 04:33:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 166 states have (on average 1.2048192771084338) internal successors, (200), 166 states have internal predecessors, (200), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 04:33:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 416 transitions. [2024-11-12 04:33:33,420 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 416 transitions. Word has length 172 [2024-11-12 04:33:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 416 transitions. [2024-11-12 04:33:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 416 transitions. [2024-11-12 04:33:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:33:33,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:33,424 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:33,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:33:33,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:33,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash -263999209, now seen corresponding path program 1 times [2024-11-12 04:33:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516609135] [2024-11-12 04:33:33,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:33:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:33:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:33:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:33:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:33:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:33:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:33:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:33:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:33:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 04:33:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 04:33:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 04:33:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 04:33:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 04:33:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 04:33:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 04:33:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 04:33:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 04:33:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 04:33:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:33:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 04:33:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 04:33:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 04:33:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 04:33:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 04:33:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 04:33:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 04:33:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 04:33:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:33:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516609135] [2024-11-12 04:33:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516609135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:33:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845217235] [2024-11-12 04:33:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:33,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:33,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:33,891 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-12 04:33:33,892 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-12 04:33:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:34,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 04:33:34,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-12 04:33:34,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:33:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 04:33:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845217235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:33:34,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:33:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-12 04:33:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978951138] [2024-11-12 04:33:34,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:33:34,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:33:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:33:34,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:33:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:33:34,584 INFO L87 Difference]: Start difference. First operand 279 states and 416 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-12 04:33:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:35,147 INFO L93 Difference]: Finished difference Result 883 states and 1291 transitions. [2024-11-12 04:33:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 04:33:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 173 [2024-11-12 04:33:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:35,155 INFO L225 Difference]: With dead ends: 883 [2024-11-12 04:33:35,155 INFO L226 Difference]: Without dead ends: 607 [2024-11-12 04:33:35,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-11-12 04:33:35,158 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 185 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:35,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 445 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:33:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-12 04:33:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 295. [2024-11-12 04:33:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 178 states have (on average 1.1685393258426966) internal successors, (208), 178 states have internal predecessors, (208), 108 states have call successors, (108), 8 states have call predecessors, (108), 8 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 04:33:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 424 transitions. [2024-11-12 04:33:35,214 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 424 transitions. Word has length 173 [2024-11-12 04:33:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:35,214 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 424 transitions. [2024-11-12 04:33:35,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-12 04:33:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 424 transitions. [2024-11-12 04:33:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 04:33:35,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:35,216 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:35,231 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-12 04:33:35,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:35,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:35,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1275116459, now seen corresponding path program 1 times [2024-11-12 04:33:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:33:35,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375433874] [2024-11-12 04:33:35,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:33:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:33:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492210583] [2024-11-12 04:33:35,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:35,517 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-12 04:33:35,518 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-12 04:33:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:33:35,727 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:33:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:33:35,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:33:35,854 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:33:35,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:33:35,884 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-12 04:33:36,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:33:36,070 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 04:33:36,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:33:36,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:33:36 BoogieIcfgContainer [2024-11-12 04:33:36,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:33:36,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:33:36,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:33:36,153 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:33:36,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:31" (3/4) ... [2024-11-12 04:33:36,156 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:33:36,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:33:36,158 INFO L158 Benchmark]: Toolchain (without parser) took 5367.93ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 72.3MB in the beginning and 182.7MB in the end (delta: -110.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:33:36,159 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:33:36,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.84ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 55.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:33:36,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 162.8MB in the end (delta: -107.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-12 04:33:36,161 INFO L158 Benchmark]: Boogie Preprocessor took 80.01ms. Allocated memory is still 192.9MB. Free memory was 162.8MB in the beginning and 156.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-12 04:33:36,161 INFO L158 Benchmark]: RCFGBuilder took 433.79ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 131.4MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 04:33:36,161 INFO L158 Benchmark]: TraceAbstraction took 4500.03ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.4MB in the beginning and 182.7MB in the end (delta: -52.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2024-11-12 04:33:36,161 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 232.8MB. Free memory is still 182.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:33:36,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.84ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 55.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 162.8MB in the end (delta: -107.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.01ms. Allocated memory is still 192.9MB. Free memory was 162.8MB in the beginning and 156.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * RCFGBuilder took 433.79ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 131.4MB in the end (delta: 25.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4500.03ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 130.4MB in the beginning and 182.7MB in the end (delta: -52.3MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 232.8MB. Free memory is still 182.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of shiftLeft at line 138, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] signed long int var_1_8 = 50; [L27] double var_1_9 = 32.7; [L28] double var_1_10 = 64.25; [L29] double var_1_11 = 10.3; [L30] double var_1_12 = 3.3; [L31] double var_1_13 = 16.5; [L32] double var_1_14 = 7.125; [L33] unsigned short int var_1_15 = 50; [L34] unsigned short int var_1_16 = 16; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 64; [L37] unsigned long int var_1_19 = 16; [L38] signed short int var_1_20 = 100; [L39] signed short int var_1_21 = 2; [L40] signed short int var_1_22 = 8; [L41] signed long int var_1_23 = -4; [L42] unsigned short int var_1_24 = 128; [L43] signed long int var_1_25 = 2; [L44] unsigned short int var_1_26 = 256; [L45] unsigned char var_1_27 = 0; [L46] signed long int last_1_var_1_8 = 50; [L47] unsigned long int last_1_var_1_19 = 16; [L48] unsigned char last_1_var_1_27 = 0; VAL [isInitial=0, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_19 = var_1_19 [L135] last_1_var_1_27 = var_1_27 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=1, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L145] RET updateLastVariables() [L146] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L90] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L91] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L92] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L94] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L95] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L96] var_1_7 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_8=50, var_1_9=327/10] [L98] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L98] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_10=257/4, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L99] var_1_10 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L100] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_11=103/10, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L102] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_12=33/10, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L104] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_13=33/2, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L105] var_1_13 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_14=57/8, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L107] var_1_14 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=16, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L109] var_1_16 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L111] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=8, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L113] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=64, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L115] var_1_18 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L116] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L117] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=100, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L118] var_1_20 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L119] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L120] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=2, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L121] var_1_21 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L122] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L123] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=8, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L124] var_1_22 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L125] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L126] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=128, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L127] var_1_24 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L128] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L129] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L130] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L146] RET updateVariables() [L147] CALL step() [L52] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L52] signed long int stepLocal_1 = -1 << last_1_var_1_19; [L53] unsigned long int stepLocal_0 = -1000000000 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, stepLocal_1=0, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L54] COND TRUE stepLocal_1 < var_1_3 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, stepLocal_0=-999999984, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=1, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L55] COND FALSE !((last_1_var_1_19 / var_1_3) > stepLocal_0) [L58] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50, var_1_9=327/10] [L61] var_1_9 = (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=50, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L62] COND TRUE var_1_10 >= var_1_11 [L63] var_1_15 = ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=2, var_1_26=256, var_1_27=0, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L65] var_1_25 = -256 [L66] var_1_26 = var_1_17 [L67] var_1_27 = var_1_6 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L68] COND FALSE !(var_1_7 || var_1_1) [L79] var_1_8 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=-4, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L81] COND TRUE var_1_6 || (var_1_16 <= (var_1_22 / var_1_24)) [L82] var_1_23 = (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=16, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L84] COND TRUE (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23 [L85] var_1_19 = ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR -1 << last_1_var_1_19 VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L138-L139] return ((((((((((-1 << last_1_var_1_19) < var_1_3) ? (((last_1_var_1_19 / var_1_3) > (-1000000000 + last_1_var_1_19)) ? (var_1_1 == ((unsigned char) (last_1_var_1_27 || var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : 1) && ((var_1_7 || var_1_1) ? (((var_1_26 >= var_1_3) && var_1_1) ? (var_1_8 == ((signed long int) ((((var_1_3) < (var_1_26)) ? (var_1_3) : (var_1_26))))) : (var_1_1 ? (var_1_8 == ((signed long int) last_1_var_1_8)) : (var_1_8 == ((signed long int) last_1_var_1_8)))) : (var_1_8 == ((signed long int) last_1_var_1_8)))) && (var_1_9 == ((double) (((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) + (var_1_12 + (var_1_13 - var_1_14)))))) && ((var_1_10 >= var_1_11) ? (var_1_15 == ((unsigned short int) ((((((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) > (var_1_18)) ? (((((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) > (var_1_17)) ? (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) : (var_1_17)))) : (var_1_18))))) : 1)) && (((((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) - var_1_22) >= var_1_23) ? (var_1_19 == ((unsigned long int) ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_6 || (var_1_16 <= (var_1_22 / var_1_24))) ? (var_1_23 == ((signed long int) (((((var_1_8 + (var_1_21 + var_1_24))) < (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((var_1_8 + (var_1_21 + var_1_24))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : 1)) && (var_1_25 == ((signed long int) -256))) && (var_1_26 == ((unsigned short int) var_1_17))) && (var_1_27 == ((unsigned char) var_1_6)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=16, last_1_var_1_27=0, last_1_var_1_8=50, var_1_15=0, var_1_16=65536, var_1_17=0, var_1_18=65536, var_1_19=0, var_1_1=0, var_1_20=-1, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=3, var_1_25=-256, var_1_26=0, var_1_27=1, var_1_3=2, var_1_6=1, var_1_7=0, var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 1078 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 422 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 592 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 326 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 2465 SizeOfPredicates, 2 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8217/8424 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-12 04:33:36,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.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 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:33:37,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:33:38,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:33:38,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:33:38,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:33:38,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:33:38,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:33:38,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:33:38,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:33:38,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:33:38,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:33:38,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:33:38,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:33:38,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:33:38,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:33:38,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:33:38,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:33:38,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:33:38,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:33:38,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:33:38,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:33:38,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:33:38,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:33:38,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:33:38,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:33:38,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:33:38,075 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:33:38,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:33:38,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:33:38,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:33:38,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:33:38,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:33:38,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:33:38,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:33:38,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:38,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:33:38,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:33:38,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:33:38,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:33:38,079 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 -> 2a608cf192602c8fc9805ca3f1921f73fd52102f794f7be756023df45e8b0a1c [2024-11-12 04:33:38,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:33:38,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:33:38,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:33:38,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:33:38,359 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:33:38,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:39,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:33:39,879 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:33:39,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:39,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a882deb76/56c667eff8b2492c9d034c0157f6c6aa/FLAGcab7f7c45 [2024-11-12 04:33:40,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a882deb76/56c667eff8b2492c9d034c0157f6c6aa [2024-11-12 04:33:40,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:33:40,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:33:40,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:40,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:33:40,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:33:40,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c33a804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40, skipping insertion in model container [2024-11-12 04:33:40,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:33:40,464 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_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-12 04:33:40,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:40,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:33:40,556 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_fillercode_fillercodestructure_normal_file-94.i[913,926] [2024-11-12 04:33:40,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:33:40,615 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:33:40,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40 WrapperNode [2024-11-12 04:33:40,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:33:40,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:40,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:33:40,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:33:40,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,670 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-12 04:33:40,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:33:40,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:33:40,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:33:40,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:33:40,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,706 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-12 04:33:40,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:33:40,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:33:40,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:33:40,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:33:40,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (1/1) ... [2024-11-12 04:33:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:33:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:33:40,768 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-12 04:33:40,770 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-12 04:33:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:33:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:33:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:33:40,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:33:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:33:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:33:40,888 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:33:40,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:33:43,268 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:33:43,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:33:43,277 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:33:43,278 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:33:43,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:43 BoogieIcfgContainer [2024-11-12 04:33:43,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:33:43,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:33:43,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:33:43,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:33:43,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:33:40" (1/3) ... [2024-11-12 04:33:43,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee227e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:43, skipping insertion in model container [2024-11-12 04:33:43,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:33:40" (2/3) ... [2024-11-12 04:33:43,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ee227e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:33:43, skipping insertion in model container [2024-11-12 04:33:43,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:33:43" (3/3) ... [2024-11-12 04:33:43,284 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-94.i [2024-11-12 04:33:43,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:33:43,296 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:33:43,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:33:43,341 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;@35d5985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:33:43,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:33:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 04:33:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 04:33:43,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:43,353 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:43,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -11235031, now seen corresponding path program 1 times [2024-11-12 04:33:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314739788] [2024-11-12 04:33:43,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:43,367 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-12 04:33:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:43,370 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-12 04:33:43,371 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-12 04:33:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:43,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:33:43,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-12 04:33:43,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:33:43,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:33:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314739788] [2024-11-12 04:33:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314739788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:33:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060627131] [2024-11-12 04:33:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:43,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:33:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:33:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:33:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:33:43,818 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 04:33:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:43,843 INFO L93 Difference]: Finished difference Result 135 states and 237 transitions. [2024-11-12 04:33:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:33:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 166 [2024-11-12 04:33:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:43,850 INFO L225 Difference]: With dead ends: 135 [2024-11-12 04:33:43,850 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 04:33:43,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-12 04:33:43,855 INFO L435 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-12 04:33:43,856 INFO L436 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-12 04:33:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 04:33:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 04:33:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 04:33:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-12 04:33:43,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 166 [2024-11-12 04:33:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:43,907 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-12 04:33:43,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 04:33:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-12 04:33:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 04:33:43,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:43,910 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:43,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:33:44,111 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-12 04:33:44,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:44,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash -914852041, now seen corresponding path program 1 times [2024-11-12 04:33:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028863021] [2024-11-12 04:33:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:44,113 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-12 04:33:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:44,114 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-12 04:33:44,115 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-12 04:33:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:44,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:33:44,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 04:33:45,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:33:45,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:33:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028863021] [2024-11-12 04:33:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028863021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:33:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:33:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:33:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689132522] [2024-11-12 04:33:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:33:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:33:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:33:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:33:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:33:45,237 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:47,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:33:50,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:33:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:50,237 INFO L93 Difference]: Finished difference Result 202 states and 304 transitions. [2024-11-12 04:33:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:33:50,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 166 [2024-11-12 04:33:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:50,269 INFO L225 Difference]: With dead ends: 202 [2024-11-12 04:33:50,269 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 04:33:50,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:33:50,271 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 68 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:50,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-12 04:33:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 04:33:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2024-11-12 04:33:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 04:33:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-11-12 04:33:50,294 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 166 [2024-11-12 04:33:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-11-12 04:33:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 04:33:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-11-12 04:33:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 04:33:50,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:50,297 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:50,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:33:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:33:50,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:50,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1950862965, now seen corresponding path program 1 times [2024-11-12 04:33:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2894058] [2024-11-12 04:33:50,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:50,500 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-12 04:33:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:50,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:33:50,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:33:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:50,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:33:50,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:33:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-12 04:33:51,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:33:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 04:33:52,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:33:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2894058] [2024-11-12 04:33:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2894058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:33:52,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:33:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-12 04:33:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075613483] [2024-11-12 04:33:52,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:33:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:33:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:33:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:33:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:33:52,060 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-12 04:33:54,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:33:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:33:55,607 INFO L93 Difference]: Finished difference Result 537 states and 799 transitions. [2024-11-12 04:33:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 04:33:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 167 [2024-11-12 04:33:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:33:55,612 INFO L225 Difference]: With dead ends: 537 [2024-11-12 04:33:55,612 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 04:33:55,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2024-11-12 04:33:55,614 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 208 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:33:55,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 244 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-12 04:33:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 04:33:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 210. [2024-11-12 04:33:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 122 states have internal predecessors, (145), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-12 04:33:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2024-11-12 04:33:55,682 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 167 [2024-11-12 04:33:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:33:55,682 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2024-11-12 04:33:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-11-12 04:33:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2024-11-12 04:33:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 04:33:55,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:33:55,687 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:33:55,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 04:33:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:33:55,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:33:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:33:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1249798387, now seen corresponding path program 1 times [2024-11-12 04:33:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:33:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423144137] [2024-11-12 04:33:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:33:55,889 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-12 04:33:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:33:55,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:33:55,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:33:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:33:56,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 04:33:56,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:34:46,877 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:34:52,418 WARN L286 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:34:58,792 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 04:35:04,770 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)