./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_filler-pe-ci_file-19.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 f4de244ba3b593cb6eaf3556b8fdd28c0a0ade3580babf520e164cbdcfa415ba --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:07:00,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:07:00,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:07:00,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:07:00,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:07:00,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:07:00,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:07:00,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:07:00,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:07:00,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:07:00,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:07:00,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:07:00,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:07:00,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:07:00,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:07:00,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:07:00,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:07:00,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:07:00,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:07:00,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:07:00,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:07:00,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:07:00,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:07:00,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:07:00,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:07:00,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:07:00,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:07:00,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:07:00,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:07:00,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:07:00,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:07:00,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:07:00,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:07:00,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:07:00,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:07:00,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:07:00,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:07:00,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:07:00,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:07:00,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:07:00,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:07:00,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:07:00,277 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 -> f4de244ba3b593cb6eaf3556b8fdd28c0a0ade3580babf520e164cbdcfa415ba [2024-11-08 21:07:00,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:07:00,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:07:00,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:07:00,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:07:00,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:07:00,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:01,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:07:02,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:07:02,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:02,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d502de910/fb28cb6b80ba4375a01c509e1a06caec/FLAG00e6a4161 [2024-11-08 21:07:02,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d502de910/fb28cb6b80ba4375a01c509e1a06caec [2024-11-08 21:07:02,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:07:02,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:07:02,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:02,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:07:02,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:07:02,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a406e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02, skipping insertion in model container [2024-11-08 21:07:02,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:07:02,776 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_filler-pe-ci_file-19.i[919,932] [2024-11-08 21:07:02,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:02,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:07:02,882 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_filler-pe-ci_file-19.i[919,932] [2024-11-08 21:07:02,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:02,949 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:07:02,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02 WrapperNode [2024-11-08 21:07:02,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:02,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:02,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:07:02,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:07:02,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,050 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-08 21:07:03,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:03,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:07:03,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:07:03,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:07:03,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,115 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-08 21:07:03,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:07:03,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:07:03,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:07:03,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:07:03,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:03,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:07:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:07:03,199 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-08 21:07:03,206 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-08 21:07:03,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:07:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:07:03,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:07:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:07:03,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:07:03,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:07:03,885 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:07:03,886 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:07:03,902 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:07:03,902 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:07:03,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:03 BoogieIcfgContainer [2024-11-08 21:07:03,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:07:03,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:07:03,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:07:03,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:07:03,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:07:02" (1/3) ... [2024-11-08 21:07:03,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40163c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:03, skipping insertion in model container [2024-11-08 21:07:03,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (2/3) ... [2024-11-08 21:07:03,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40163c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:03, skipping insertion in model container [2024-11-08 21:07:03,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:03" (3/3) ... [2024-11-08 21:07:03,914 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:03,931 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:07:03,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:07:03,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:07:04,001 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;@a373927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:07:04,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:07:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:07:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 21:07:04,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:04,024 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:04,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:04,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash -772766642, now seen corresponding path program 1 times [2024-11-08 21:07:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186367675] [2024-11-08 21:07:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:07:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:07:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:07:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:07:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:07:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:07:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:07:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:07:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:07:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:07:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:07:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:07:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:07:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:07:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:07:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:07:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:07:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:07:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:07:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:07:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:07:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:07:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:07:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:07:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:07:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:07:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:07:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:07:04,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186367675] [2024-11-08 21:07:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186367675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:07:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870034475] [2024-11-08 21:07:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:07:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:07:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:07:04,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:07:04,691 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:04,727 INFO L93 Difference]: Finished difference Result 173 states and 302 transitions. [2024-11-08 21:07:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:07:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-08 21:07:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:04,739 INFO L225 Difference]: With dead ends: 173 [2024-11-08 21:07:04,739 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 21:07:04,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-08 21:07:04,748 INFO L432 NwaCegarLoop]: 131 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, 131 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-08 21:07:04,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:07:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 21:07:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 21:07:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:07:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-08 21:07:04,838 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 169 [2024-11-08 21:07:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:04,841 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-08 21:07:04,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-08 21:07:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:07:04,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:04,848 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:04,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:07:04,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:04,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2113238633, now seen corresponding path program 1 times [2024-11-08 21:07:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412514777] [2024-11-08 21:07:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:07:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:07:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:07:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:07:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:07:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:07:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:07:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:07:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:07:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:07:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:07:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:07:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:07:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:07:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:07:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:07:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:07:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:07:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:07:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:07:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:07:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:07:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:07:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:07:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:07:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:07:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:07:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:07:05,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412514777] [2024-11-08 21:07:05,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412514777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:05,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:05,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:07:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778239464] [2024-11-08 21:07:05,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:07:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:07:05,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:07:05,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:07:05,282 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:05,372 INFO L93 Difference]: Finished difference Result 240 states and 368 transitions. [2024-11-08 21:07:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:07:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 21:07:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:05,379 INFO L225 Difference]: With dead ends: 240 [2024-11-08 21:07:05,380 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 21:07:05,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-08 21:07:05,384 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 104 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:05,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:07:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 21:07:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-08 21:07:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:07:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 235 transitions. [2024-11-08 21:07:05,420 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 235 transitions. Word has length 170 [2024-11-08 21:07:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:05,421 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 235 transitions. [2024-11-08 21:07:05,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-11-08 21:07:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:07:05,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:05,424 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:05,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:07:05,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 873035069, now seen corresponding path program 1 times [2024-11-08 21:07:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152014031] [2024-11-08 21:07:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:07:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:07:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:07:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:07:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:07:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:07:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:07:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:07:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:07:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:07:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:07:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:07:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:07:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:07:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:07:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:07:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:07:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:07:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:07:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:07:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:07:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:07:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:07:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:07:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:07:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:07:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:07:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:07:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152014031] [2024-11-08 21:07:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152014031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:07:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991321998] [2024-11-08 21:07:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:07:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:07:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:07:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:07:05,966 INFO L87 Difference]: Start difference. First operand 155 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:06,162 INFO L93 Difference]: Finished difference Result 513 states and 778 transitions. [2024-11-08 21:07:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:07:06,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:07:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:06,166 INFO L225 Difference]: With dead ends: 513 [2024-11-08 21:07:06,166 INFO L226 Difference]: Without dead ends: 361 [2024-11-08 21:07:06,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-08 21:07:06,169 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 133 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:06,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 422 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:07:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-08 21:07:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 305. [2024-11-08 21:07:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 21:07:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 462 transitions. [2024-11-08 21:07:06,228 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 462 transitions. Word has length 172 [2024-11-08 21:07:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:06,228 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 462 transitions. [2024-11-08 21:07:06,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 462 transitions. [2024-11-08 21:07:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:07:06,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:06,231 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:07:06,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:06,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1091889787, now seen corresponding path program 1 times [2024-11-08 21:07:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296664864] [2024-11-08 21:07:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:07:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:07:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:07:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:07:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:07:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:07:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:07:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:07:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:07:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:07:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:07:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:07:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:07:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:07:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:07:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:07:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:07:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:07:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:07:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:07:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:07:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:07:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:07:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:07:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:07:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:07:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:07:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:07:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296664864] [2024-11-08 21:07:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296664864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:07:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900821781] [2024-11-08 21:07:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:07:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:07:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:07:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:07:08,023 INFO L87 Difference]: Start difference. First operand 305 states and 462 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:08,296 INFO L93 Difference]: Finished difference Result 795 states and 1183 transitions. [2024-11-08 21:07:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:07:08,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:07:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:08,302 INFO L225 Difference]: With dead ends: 795 [2024-11-08 21:07:08,302 INFO L226 Difference]: Without dead ends: 493 [2024-11-08 21:07:08,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:07:08,305 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 121 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:08,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 306 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:07:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-08 21:07:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 325. [2024-11-08 21:07:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 21:07:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2024-11-08 21:07:08,354 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 172 [2024-11-08 21:07:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:08,355 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2024-11-08 21:07:08,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2024-11-08 21:07:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:07:08,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:08,358 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:08,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:07:08,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:08,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1678695801, now seen corresponding path program 1 times [2024-11-08 21:07:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810904565] [2024-11-08 21:07:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:07:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:07:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:07:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:07:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:07:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:07:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:07:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:07:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:07:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:07:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:07:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:07:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:07:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:07:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:07:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 21:07:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:07:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:07:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:07:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:07:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:07:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:07:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:07:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:07:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:07:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:07:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 21:07:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:07:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810904565] [2024-11-08 21:07:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810904565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:07:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472101328] [2024-11-08 21:07:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:07:08,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:07:08,827 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-08 21:07:08,829 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-08 21:07:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:09,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:07:09,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 663 proven. 42 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2024-11-08 21:07:09,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:07:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 21:07:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472101328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:07:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:07:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 21:07:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945889767] [2024-11-08 21:07:09,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:07:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:07:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:07:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:07:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:07:09,539 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 21:07:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:09,850 INFO L93 Difference]: Finished difference Result 519 states and 762 transitions. [2024-11-08 21:07:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 21:07:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 172 [2024-11-08 21:07:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:09,857 INFO L225 Difference]: With dead ends: 519 [2024-11-08 21:07:09,857 INFO L226 Difference]: Without dead ends: 357 [2024-11-08 21:07:09,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:07:09,859 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 345 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:09,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 239 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:07:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-08 21:07:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2024-11-08 21:07:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 228 states have (on average 1.263157894736842) internal successors, (288), 228 states have internal predecessors, (288), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 21:07:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 496 transitions. [2024-11-08 21:07:09,907 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 496 transitions. Word has length 172 [2024-11-08 21:07:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:09,908 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 496 transitions. [2024-11-08 21:07:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-08 21:07:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 496 transitions. [2024-11-08 21:07:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:07:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:09,911 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:09,929 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-08 21:07:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:07:10,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 398832123, now seen corresponding path program 1 times [2024-11-08 21:07:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:07:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314205805] [2024-11-08 21:07:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:07:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:07:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796693976] [2024-11-08 21:07:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:07:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:07:10,227 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-08 21:07:10,229 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-08 21:07:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:07:10,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:07:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:07:10,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:07:10,542 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:07:10,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:07:10,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:07:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 21:07:10,748 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 21:07:10,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:07:10,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:07:10 BoogieIcfgContainer [2024-11-08 21:07:10,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:07:10,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:07:10,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:07:10,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:07:10,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:03" (3/4) ... [2024-11-08 21:07:10,868 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:07:10,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:07:10,870 INFO L158 Benchmark]: Toolchain (without parser) took 8303.58ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 135.3MB in the beginning and 165.2MB in the end (delta: -29.9MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,871 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:07:10,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 117.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.67ms. Allocated memory is still 165.7MB. Free memory was 117.3MB in the beginning and 109.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,872 INFO L158 Benchmark]: Boogie Preprocessor took 109.62ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,873 INFO L158 Benchmark]: RCFGBuilder took 740.04ms. Allocated memory is still 165.7MB. Free memory was 97.2MB in the beginning and 113.0MB in the end (delta: -15.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,874 INFO L158 Benchmark]: TraceAbstraction took 6958.34ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 113.0MB in the beginning and 165.2MB in the end (delta: -52.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-08 21:07:10,874 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 257.9MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:07:10,876 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.12ms. Allocated memory is still 125.8MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.61ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 117.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.67ms. Allocated memory is still 165.7MB. Free memory was 117.3MB in the beginning and 109.7MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.62ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 97.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 740.04ms. Allocated memory is still 165.7MB. Free memory was 97.2MB in the beginning and 113.0MB in the end (delta: -15.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6958.34ms. Allocated memory was 165.7MB in the beginning and 257.9MB in the end (delta: 92.3MB). Free memory was 113.0MB in the beginning and 165.2MB in the end (delta: -52.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 257.9MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someUnaryFLOAToperation at line 93, overapproximation of someBinaryArithmeticFLOAToperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] unsigned char var_1_32 = 8; [L45] float var_1_35 = 1.15; [L46] float var_1_38 = 1000000.4; [L47] float var_1_39 = 32.25; [L48] signed char var_1_42 = -25; [L49] signed char var_1_46 = -1; [L50] unsigned char var_1_47 = 0; [L51] unsigned char var_1_49 = 1; [L52] unsigned char var_1_50 = 1; [L53] unsigned char last_1_var_1_15 = 0; VAL [isInitial=0, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L170] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L180] RET updateLastVariables() [L181] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L128] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L129] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L129] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=64, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L130] var_1_3 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L131] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L132] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L132] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L133] var_1_7 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L134] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L135] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L135] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L137] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L139] var_1_9 = __VERIFIER_nondet_short() [L140] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L140] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L143] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L146] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L147] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L147] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L148] var_1_21 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L149] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L150] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L150] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L151] var_1_23 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L152] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L153] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L153] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L154] var_1_25 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L155] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L156] var_1_26 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L157] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L158] var_1_27 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L159] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L160] var_1_28 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L161] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-1, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L162] var_1_46 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_46 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L163] RET assume_abort_if_not(var_1_46 >= -63) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L164] CALL assume_abort_if_not(var_1_46 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L164] RET assume_abort_if_not(var_1_46 <= 63) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L165] var_1_49 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_49 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L166] RET assume_abort_if_not(var_1_49 >= 1) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L167] CALL assume_abort_if_not(var_1_49 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L167] RET assume_abort_if_not(var_1_49 <= 1) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L181] RET updateVariables() [L182] CALL step() [L57] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L60] COND FALSE !(\read(var_1_10)) [L63] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L65] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L66] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L68] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L75] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L77] COND TRUE var_1_24 != var_1_24 [L78] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L80] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=16511, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L81] COND TRUE stepLocal_1 >= var_1_29 [L82] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L84] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L87] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=127, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L88] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L89] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_29=127, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_35=23/20, var_1_38=5000002/5, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L93] var_1_30 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) [L94] var_1_32 = (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_3) [L95] var_1_35 = ((((var_1_27) > (((((8.9f) > ((var_1_27 - var_1_27))) ? (8.9f) : ((var_1_27 - var_1_27)))))) ? (var_1_27) : (((((8.9f) > ((var_1_27 - var_1_27))) ? (8.9f) : ((var_1_27 - var_1_27))))))) [L96] var_1_38 = ((((50.8f) < 0 ) ? -(50.8f) : (50.8f))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L97] COND TRUE (~ var_1_3) < (var_1_3 * var_1_2) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L98] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L101] EXPR var_1_3 | var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=129/4, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L101] COND TRUE (var_1_3 | var_1_2) >= var_1_3 [L102] var_1_39 = var_1_27 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L108] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L115] COND TRUE var_1_28 >= ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) [L116] var_1_47 = var_1_13 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=1, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L124] var_1_50 = var_1_13 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=0, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L182] RET step() [L183] CALL, EXPR property() [L173-L174] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=0, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=0, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=-16383, var_1_24=2, var_1_27=5, var_1_28=0, var_1_29=127, var_1_2=127, var_1_30=3, var_1_32=0, var_1_35=5, var_1_38=4, var_1_39=5, var_1_3=0, var_1_42=-25, var_1_46=-63, var_1_47=0, var_1_49=1, var_1_50=0, var_1_6=-32639, var_1_7=32767, var_1_8=16383, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 729 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 1418 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 698 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 720 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 634 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 242 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 2431 SizeOfPredicates, 2 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8974/9100 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-08 21:07:10,913 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_filler-pe-ci_file-19.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 f4de244ba3b593cb6eaf3556b8fdd28c0a0ade3580babf520e164cbdcfa415ba --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:07:13,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:07:13,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:07:13,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:07:13,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:07:13,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:07:13,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:07:13,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:07:13,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:07:13,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:07:13,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:07:13,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:07:13,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:07:13,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:07:13,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:07:13,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:07:13,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:07:13,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:07:13,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:07:13,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:07:13,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:07:13,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:07:13,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:07:13,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:07:13,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:07:13,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:07:13,280 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:07:13,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:07:13,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:07:13,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:07:13,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:07:13,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:07:13,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:07:13,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:07:13,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:07:13,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:07:13,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:07:13,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:07:13,290 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:07:13,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:07:13,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:07:13,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:07:13,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:07:13,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:07:13,293 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 -> f4de244ba3b593cb6eaf3556b8fdd28c0a0ade3580babf520e164cbdcfa415ba [2024-11-08 21:07:13,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:07:13,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:07:13,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:07:13,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:07:13,636 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:07:13,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:15,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:07:15,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:07:15,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:15,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2533656f/7fb0a7c9c3ae494caff869979bd7c2fb/FLAG220183608 [2024-11-08 21:07:15,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2533656f/7fb0a7c9c3ae494caff869979bd7c2fb [2024-11-08 21:07:15,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:07:15,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:07:15,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:15,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:07:15,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:07:15,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:15" (1/1) ... [2024-11-08 21:07:15,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6897c376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:15, skipping insertion in model container [2024-11-08 21:07:15,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:15" (1/1) ... [2024-11-08 21:07:15,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:07:15,991 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_filler-pe-ci_file-19.i[919,932] [2024-11-08 21:07:16,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:16,085 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:07:16,097 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_filler-pe-ci_file-19.i[919,932] [2024-11-08 21:07:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:16,156 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:07:16,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16 WrapperNode [2024-11-08 21:07:16,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:16,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:16,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:07:16,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:07:16,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,229 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-08 21:07:16,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:16,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:07:16,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:07:16,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:07:16,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,264 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-08 21:07:16,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:07:16,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:07:16,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:07:16,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:07:16,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (1/1) ... [2024-11-08 21:07:16,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:07:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:07:16,360 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-08 21:07:16,363 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-08 21:07:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:07:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:07:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:07:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:07:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:07:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:07:16,489 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:07:16,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:07:30,649 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:07:30,649 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:07:30,666 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:07:30,666 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:07:30,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:30 BoogieIcfgContainer [2024-11-08 21:07:30,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:07:30,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:07:30,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:07:30,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:07:30,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:07:15" (1/3) ... [2024-11-08 21:07:30,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aafacd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:30, skipping insertion in model container [2024-11-08 21:07:30,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:16" (2/3) ... [2024-11-08 21:07:30,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aafacd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:30, skipping insertion in model container [2024-11-08 21:07:30,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:30" (3/3) ... [2024-11-08 21:07:30,686 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-19.i [2024-11-08 21:07:30,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:07:30,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:07:30,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:07:30,780 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;@5623ed18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:07:30,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:07:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:07:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 21:07:30,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:30,803 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:30,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:30,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:30,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1388120325, now seen corresponding path program 1 times [2024-11-08 21:07:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705680725] [2024-11-08 21:07:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:30,821 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-08 21:07:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:30,822 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-08 21:07:30,823 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-08 21:07:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:31,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:07:31,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 21:07:31,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:07:31,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:07:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705680725] [2024-11-08 21:07:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705680725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:07:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854697855] [2024-11-08 21:07:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:07:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:07:31,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:07:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:07:31,875 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:07:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:31,915 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-11-08 21:07:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:07:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-08 21:07:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:31,925 INFO L225 Difference]: With dead ends: 153 [2024-11-08 21:07:31,925 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 21:07:31,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-08 21:07:31,932 INFO L432 NwaCegarLoop]: 115 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, 115 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-08 21:07:31,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:07:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 21:07:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 21:07:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:07:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-08 21:07:31,992 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 169 [2024-11-08 21:07:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:31,993 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-08 21:07:31,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:07:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-08 21:07:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:07:31,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:32,000 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:07:32,029 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-08 21:07:32,200 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-08 21:07:32,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1534086940, now seen corresponding path program 1 times [2024-11-08 21:07:32,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:32,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298644653] [2024-11-08 21:07:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:32,203 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-08 21:07:32,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:32,207 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-08 21:07:32,208 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-08 21:07:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:33,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 21:07:33,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:07:38,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:07:38,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:07:38,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298644653] [2024-11-08 21:07:38,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298644653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:38,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:38,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:07:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332722937] [2024-11-08 21:07:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:07:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:07:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:07:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:07:38,575 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:07:43,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:47,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:51,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:56,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:00,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:04,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:08,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:08,084 INFO L93 Difference]: Finished difference Result 266 states and 402 transitions. [2024-11-08 21:08:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:08:08,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 21:08:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:08,279 INFO L225 Difference]: With dead ends: 266 [2024-11-08 21:08:08,279 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 21:08:08,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:08:08,281 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 125 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 57 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:08,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 384 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 29.4s Time] [2024-11-08 21:08:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 21:08:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 147. [2024-11-08 21:08:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:08:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2024-11-08 21:08:08,331 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 170 [2024-11-08 21:08:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:08,337 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2024-11-08 21:08:08,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:08:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2024-11-08 21:08:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:08:08,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:08,342 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:08,373 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-08 21:08:08,543 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-08 21:08:08,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1943231906, now seen corresponding path program 1 times [2024-11-08 21:08:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:08:08,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717535894] [2024-11-08 21:08:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:08,545 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-08 21:08:08,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:08:08,548 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-08 21:08:08,550 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-08 21:08:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:09,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:08:09,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:08:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:08:09,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:08:09,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:08:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717535894] [2024-11-08 21:08:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717535894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:08:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061670133] [2024-11-08 21:08:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:08:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:08:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:08:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:09,684 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:08:14,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:18,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:08:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:18,711 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2024-11-08 21:08:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:08:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 21:08:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:18,720 INFO L225 Difference]: With dead ends: 431 [2024-11-08 21:08:18,720 INFO L226 Difference]: Without dead ends: 287 [2024-11-08 21:08:18,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:18,730 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 104 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:18,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 287 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-08 21:08:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-08 21:08:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2024-11-08 21:08:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 176 states have internal predecessors, (222), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 21:08:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 430 transitions. [2024-11-08 21:08:18,828 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 430 transitions. Word has length 170 [2024-11-08 21:08:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:18,829 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 430 transitions. [2024-11-08 21:08:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:08:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 430 transitions. [2024-11-08 21:08:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:08:18,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:18,832 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:08:18,864 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:08:19,033 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-08 21:08:19,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -604104151, now seen corresponding path program 1 times [2024-11-08 21:08:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:08:19,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132473133] [2024-11-08 21:08:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:19,035 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-08 21:08:19,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:08:19,038 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-08 21:08:19,038 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-08 21:08:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:20,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:08:20,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:08:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:08:26,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:08:26,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:08:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132473133] [2024-11-08 21:08:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132473133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:26,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:26,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:08:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063671609] [2024-11-08 21:08:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:08:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:08:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:08:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:08:26,357 INFO L87 Difference]: Start difference. First operand 285 states and 430 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:08:30,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []