./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:23:55,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:23:55,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:23:55,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:23:55,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:23:55,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:23:55,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:23:55,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:23:55,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:23:55,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:23:55,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:23:55,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:23:55,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:23:55,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:23:55,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:23:55,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:23:55,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:23:55,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:23:55,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:23:55,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:23:55,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:23:55,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:23:55,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:23:55,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:23:55,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:23:55,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:23:55,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:23:55,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:23:55,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:23:55,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:23:55,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:23:55,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:23:55,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:23:55,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:23:55,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:23:55,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:23:55,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:23:55,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:23:55,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:23:55,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:23:55,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:23:55,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:23:55,984 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-11-10 06:23:56,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:23:56,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:23:56,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:23:56,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:23:56,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:23:56,353 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-ps-co_file-7.i [2024-11-10 06:23:57,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:23:58,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:23:58,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-10 06:23:58,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5710902ae/ec631f9ad5544bd4818c68075c7340b5/FLAG0042c9b35 [2024-11-10 06:23:58,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5710902ae/ec631f9ad5544bd4818c68075c7340b5 [2024-11-10 06:23:58,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:23:58,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:23:58,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:23:58,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:23:58,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:23:58,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:23:58" (1/1) ... [2024-11-10 06:23:58,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b94a932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:58, skipping insertion in model container [2024-11-10 06:23:58,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:23:58" (1/1) ... [2024-11-10 06:23:58,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:23:58,828 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-ps-co_file-7.i[918,931] [2024-11-10 06:23:58,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:23:58,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:23:58,954 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-ps-co_file-7.i[918,931] [2024-11-10 06:23:58,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:23:59,027 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:23:59,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59 WrapperNode [2024-11-10 06:23:59,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:23:59,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:23:59,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:23:59,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:23:59,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,109 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 298 [2024-11-10 06:23:59,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:23:59,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:23:59,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:23:59,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:23:59,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:23:59,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:23:59,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:23:59,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:23:59,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:23:59,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (1/1) ... [2024-11-10 06:23:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:23:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:23:59,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:23:59,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:23:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:23:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:23:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:23:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:23:59,476 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:23:59,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:24:00,066 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 06:24:00,067 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:24:00,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:24:00,126 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:24:00,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:00 BoogieIcfgContainer [2024-11-10 06:24:00,127 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:24:00,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:24:00,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:24:00,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:24:00,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:23:58" (1/3) ... [2024-11-10 06:24:00,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37cf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:00, skipping insertion in model container [2024-11-10 06:24:00,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:23:59" (2/3) ... [2024-11-10 06:24:00,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e37cf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:00, skipping insertion in model container [2024-11-10 06:24:00,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:00" (3/3) ... [2024-11-10 06:24:00,140 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-10 06:24:00,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:24:00,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:24:00,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:24:00,243 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;@27b46fc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:24:00,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:24:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 91 states have internal predecessors, (128), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:24:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-10 06:24:00,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:00,276 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:00,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1009014227, now seen corresponding path program 1 times [2024-11-10 06:24:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543182981] [2024-11-10 06:24:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:01,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543182981] [2024-11-10 06:24:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543182981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:01,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:24:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367507009] [2024-11-10 06:24:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:01,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:24:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:24:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:24:01,118 INFO L87 Difference]: Start difference. First operand has 128 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 91 states have internal predecessors, (128), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:01,185 INFO L93 Difference]: Finished difference Result 243 states and 417 transitions. [2024-11-10 06:24:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:24:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 232 [2024-11-10 06:24:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:01,201 INFO L225 Difference]: With dead ends: 243 [2024-11-10 06:24:01,202 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 06:24:01,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:24:01,214 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:01,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:24:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 06:24:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 06:24:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:24:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-11-10 06:24:01,280 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 232 [2024-11-10 06:24:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:01,281 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-11-10 06:24:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-11-10 06:24:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-10 06:24:01,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:01,288 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:24:01,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -783599039, now seen corresponding path program 1 times [2024-11-10 06:24:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551878065] [2024-11-10 06:24:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551878065] [2024-11-10 06:24:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551878065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:02,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:24:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058418368] [2024-11-10 06:24:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:02,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:02,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:02,046 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:02,163 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2024-11-10 06:24:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 232 [2024-11-10 06:24:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:02,169 INFO L225 Difference]: With dead ends: 348 [2024-11-10 06:24:02,169 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 06:24:02,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10 06:24:02,173 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:02,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 349 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:24:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 06:24:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-10 06:24:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 157 states have (on average 1.3630573248407643) internal successors, (214), 157 states have internal predecessors, (214), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:24:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2024-11-10 06:24:02,225 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 232 [2024-11-10 06:24:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2024-11-10 06:24:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2024-11-10 06:24:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-10 06:24:02,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:02,238 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:24:02,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1597377608, now seen corresponding path program 1 times [2024-11-10 06:24:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615189508] [2024-11-10 06:24:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:02,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:02,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615189508] [2024-11-10 06:24:02,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615189508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:02,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:02,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:24:02,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77008026] [2024-11-10 06:24:02,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:02,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:02,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:02,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:02,774 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:02,876 INFO L93 Difference]: Finished difference Result 554 states and 853 transitions. [2024-11-10 06:24:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:02,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 235 [2024-11-10 06:24:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:02,886 INFO L225 Difference]: With dead ends: 554 [2024-11-10 06:24:02,887 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 06:24:02,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10 06:24:02,894 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 81 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:02,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:24:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 06:24:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-11-10 06:24:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 states have internal predecessors, (250), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 460 transitions. [2024-11-10 06:24:02,976 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 460 transitions. Word has length 235 [2024-11-10 06:24:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:02,977 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 460 transitions. [2024-11-10 06:24:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 460 transitions. [2024-11-10 06:24:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-10 06:24:02,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:02,982 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:24:02,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1187861977, now seen corresponding path program 1 times [2024-11-10 06:24:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417954937] [2024-11-10 06:24:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417954937] [2024-11-10 06:24:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417954937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:24:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775737465] [2024-11-10 06:24:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:03,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:03,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:03,420 INFO L87 Difference]: Start difference. First operand 301 states and 460 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:03,515 INFO L93 Difference]: Finished difference Result 554 states and 852 transitions. [2024-11-10 06:24:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 236 [2024-11-10 06:24:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:03,522 INFO L225 Difference]: With dead ends: 554 [2024-11-10 06:24:03,523 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 06:24:03,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10 06:24:03,529 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 79 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:03,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 330 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:24:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 06:24:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2024-11-10 06:24:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 461 transitions. [2024-11-10 06:24:03,582 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 461 transitions. Word has length 236 [2024-11-10 06:24:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:03,584 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 461 transitions. [2024-11-10 06:24:03,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 461 transitions. [2024-11-10 06:24:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-10 06:24:03,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:03,589 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:24:03,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1882050038, now seen corresponding path program 1 times [2024-11-10 06:24:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628415883] [2024-11-10 06:24:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:03,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:03,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628415883] [2024-11-10 06:24:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628415883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:03,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:24:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047062487] [2024-11-10 06:24:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:03,947 INFO L87 Difference]: Start difference. First operand 302 states and 461 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:04,008 INFO L93 Difference]: Finished difference Result 560 states and 861 transitions. [2024-11-10 06:24:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 237 [2024-11-10 06:24:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:04,013 INFO L225 Difference]: With dead ends: 560 [2024-11-10 06:24:04,014 INFO L226 Difference]: Without dead ends: 333 [2024-11-10 06:24:04,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-10 06:24:04,017 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 78 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:04,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 341 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:24:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-10 06:24:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 318. [2024-11-10 06:24:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 209 states have (on average 1.3205741626794258) internal successors, (276), 209 states have internal predecessors, (276), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 486 transitions. [2024-11-10 06:24:04,063 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 486 transitions. Word has length 237 [2024-11-10 06:24:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:04,065 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 486 transitions. [2024-11-10 06:24:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 486 transitions. [2024-11-10 06:24:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-10 06:24:04,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:04,069 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:04,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:24:04,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:04,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1095699838, now seen corresponding path program 1 times [2024-11-10 06:24:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528924504] [2024-11-10 06:24:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528924504] [2024-11-10 06:24:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528924504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:24:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679564669] [2024-11-10 06:24:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:04,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:24:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:24:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:24:04,491 INFO L87 Difference]: Start difference. First operand 318 states and 486 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:04,579 INFO L93 Difference]: Finished difference Result 562 states and 863 transitions. [2024-11-10 06:24:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:24:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 239 [2024-11-10 06:24:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:04,586 INFO L225 Difference]: With dead ends: 562 [2024-11-10 06:24:04,586 INFO L226 Difference]: Without dead ends: 335 [2024-11-10 06:24:04,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:24:04,589 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 75 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:04,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 501 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:24:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-10 06:24:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 321. [2024-11-10 06:24:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 212 states have (on average 1.3160377358490567) internal successors, (279), 212 states have internal predecessors, (279), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 489 transitions. [2024-11-10 06:24:04,622 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 489 transitions. Word has length 239 [2024-11-10 06:24:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 489 transitions. [2024-11-10 06:24:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 489 transitions. [2024-11-10 06:24:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-10 06:24:04,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:04,627 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:24:04,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 653341597, now seen corresponding path program 1 times [2024-11-10 06:24:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995901262] [2024-11-10 06:24:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995901262] [2024-11-10 06:24:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995901262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:24:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8872179] [2024-11-10 06:24:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:24:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:24:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:24:05,682 INFO L87 Difference]: Start difference. First operand 321 states and 489 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:06,202 INFO L93 Difference]: Finished difference Result 611 states and 926 transitions. [2024-11-10 06:24:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:24:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 240 [2024-11-10 06:24:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:06,207 INFO L225 Difference]: With dead ends: 611 [2024-11-10 06:24:06,207 INFO L226 Difference]: Without dead ends: 371 [2024-11-10 06:24:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:24:06,209 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 219 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 695 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:24:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-10 06:24:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 335. [2024-11-10 06:24:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 225 states have (on average 1.3066666666666666) internal successors, (294), 225 states have internal predecessors, (294), 105 states have call successors, (105), 4 states have call predecessors, (105), 4 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 504 transitions. [2024-11-10 06:24:06,256 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 504 transitions. Word has length 240 [2024-11-10 06:24:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:06,257 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 504 transitions. [2024-11-10 06:24:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 504 transitions. [2024-11-10 06:24:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-10 06:24:06,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:06,260 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:06,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:24:06,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1919395967, now seen corresponding path program 1 times [2024-11-10 06:24:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598155218] [2024-11-10 06:24:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598155218] [2024-11-10 06:24:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598155218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:24:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018937850] [2024-11-10 06:24:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:24:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:24:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:24:06,977 INFO L87 Difference]: Start difference. First operand 335 states and 504 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:07,257 INFO L93 Difference]: Finished difference Result 629 states and 954 transitions. [2024-11-10 06:24:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:24:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 241 [2024-11-10 06:24:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:07,261 INFO L225 Difference]: With dead ends: 629 [2024-11-10 06:24:07,262 INFO L226 Difference]: Without dead ends: 389 [2024-11-10 06:24:07,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:24:07,265 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 267 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:07,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 371 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:24:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-10 06:24:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 336. [2024-11-10 06:24:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.3097345132743363) internal successors, (296), 226 states have internal predecessors, (296), 105 states have call successors, (105), 4 states have call predecessors, (105), 4 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-10 06:24:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 506 transitions. [2024-11-10 06:24:07,315 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 506 transitions. Word has length 241 [2024-11-10 06:24:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 506 transitions. [2024-11-10 06:24:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 506 transitions. [2024-11-10 06:24:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-10 06:24:07,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:07,319 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:24:07,320 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:07,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2036639591, now seen corresponding path program 1 times [2024-11-10 06:24:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198925373] [2024-11-10 06:24:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198925373] [2024-11-10 06:24:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198925373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:24:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271273394] [2024-11-10 06:24:07,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:07,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:24:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:24:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:24:07,681 INFO L87 Difference]: Start difference. First operand 336 states and 506 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:07,877 INFO L93 Difference]: Finished difference Result 767 states and 1169 transitions. [2024-11-10 06:24:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:24:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 241 [2024-11-10 06:24:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:07,882 INFO L225 Difference]: With dead ends: 767 [2024-11-10 06:24:07,882 INFO L226 Difference]: Without dead ends: 527 [2024-11-10 06:24:07,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:24:07,884 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 119 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:07,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 453 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:24:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-10 06:24:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2024-11-10 06:24:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 362 states have (on average 1.3342541436464088) internal successors, (483), 364 states have internal predecessors, (483), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:24:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 789 transitions. [2024-11-10 06:24:07,990 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 789 transitions. Word has length 241 [2024-11-10 06:24:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:07,991 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 789 transitions. [2024-11-10 06:24:07,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 789 transitions. [2024-11-10 06:24:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-10 06:24:07,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:07,995 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 06:24:07,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1531080966, now seen corresponding path program 1 times [2024-11-10 06:24:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772266214] [2024-11-10 06:24:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:08,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772266214] [2024-11-10 06:24:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772266214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:24:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930407219] [2024-11-10 06:24:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:24:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:09,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:24:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:24:09,008 INFO L87 Difference]: Start difference. First operand 522 states and 789 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:09,919 INFO L93 Difference]: Finished difference Result 1003 states and 1522 transitions. [2024-11-10 06:24:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:24:09,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 241 [2024-11-10 06:24:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:09,926 INFO L225 Difference]: With dead ends: 1003 [2024-11-10 06:24:09,926 INFO L226 Difference]: Without dead ends: 594 [2024-11-10 06:24:09,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:24:09,929 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 172 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:09,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 935 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 06:24:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-10 06:24:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 531. [2024-11-10 06:24:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 371 states have (on average 1.3315363881401616) internal successors, (494), 373 states have internal predecessors, (494), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:24:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 800 transitions. [2024-11-10 06:24:09,991 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 800 transitions. Word has length 241 [2024-11-10 06:24:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:09,992 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 800 transitions. [2024-11-10 06:24:09,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 800 transitions. [2024-11-10 06:24:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 06:24:09,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:09,995 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:09,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 06:24:09,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1614990455, now seen corresponding path program 1 times [2024-11-10 06:24:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172820923] [2024-11-10 06:24:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172820923] [2024-11-10 06:24:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172820923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 06:24:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382658827] [2024-11-10 06:24:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:10,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:24:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:24:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:24:10,613 INFO L87 Difference]: Start difference. First operand 531 states and 800 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:11,236 INFO L93 Difference]: Finished difference Result 979 states and 1486 transitions. [2024-11-10 06:24:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:24:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 242 [2024-11-10 06:24:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:11,241 INFO L225 Difference]: With dead ends: 979 [2024-11-10 06:24:11,241 INFO L226 Difference]: Without dead ends: 571 [2024-11-10 06:24:11,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 06:24:11,243 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 127 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:11,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 778 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 06:24:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-10 06:24:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 531. [2024-11-10 06:24:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 371 states have (on average 1.3288409703504043) internal successors, (493), 373 states have internal predecessors, (493), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:24:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 799 transitions. [2024-11-10 06:24:11,299 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 799 transitions. Word has length 242 [2024-11-10 06:24:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:11,300 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 799 transitions. [2024-11-10 06:24:11,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 799 transitions. [2024-11-10 06:24:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-10 06:24:11,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:11,303 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:11,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 06:24:11,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1830950943, now seen corresponding path program 1 times [2024-11-10 06:24:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835861081] [2024-11-10 06:24:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 06:24:11,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:11,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835861081] [2024-11-10 06:24:11,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835861081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:24:11,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021673293] [2024-11-10 06:24:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:11,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:24:11,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:24:11,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:24:11,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:24:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:12,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 06:24:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-11-10 06:24:12,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:24:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 06:24:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021673293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:24:13,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:24:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 15 [2024-11-10 06:24:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769618706] [2024-11-10 06:24:13,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:24:13,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 06:24:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 06:24:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-10 06:24:13,559 INFO L87 Difference]: Start difference. First operand 531 states and 799 transitions. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-11-10 06:24:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:14,618 INFO L93 Difference]: Finished difference Result 1381 states and 2088 transitions. [2024-11-10 06:24:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 06:24:14,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 242 [2024-11-10 06:24:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:14,626 INFO L225 Difference]: With dead ends: 1381 [2024-11-10 06:24:14,627 INFO L226 Difference]: Without dead ends: 959 [2024-11-10 06:24:14,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-10 06:24:14,629 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 660 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:14,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1097 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 06:24:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-10 06:24:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 569. [2024-11-10 06:24:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 408 states have (on average 1.338235294117647) internal successors, (546), 410 states have internal predecessors, (546), 153 states have call successors, (153), 7 states have call predecessors, (153), 7 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:24:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 852 transitions. [2024-11-10 06:24:14,704 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 852 transitions. Word has length 242 [2024-11-10 06:24:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 852 transitions. [2024-11-10 06:24:14,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-11-10 06:24:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 852 transitions. [2024-11-10 06:24:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-10 06:24:14,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:14,708 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:14,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:24:14,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 06:24:14,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:14,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1439039679, now seen corresponding path program 1 times [2024-11-10 06:24:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052713876] [2024-11-10 06:24:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:24:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:24:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:24:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:24:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:24:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:24:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 06:24:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:24:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 06:24:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:24:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:24:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:24:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:24:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:24:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:24:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:24:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:24:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:24:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:24:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:24:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 06:24:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 06:24:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:24:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:24:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 06:24:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:24:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 06:24:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 06:24:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 06:24:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-10 06:24:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 06:24:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:24:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:24:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 06:24:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 06:24:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:24:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052713876] [2024-11-10 06:24:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052713876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 06:24:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648091889] [2024-11-10 06:24:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 06:24:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:24:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 06:24:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:24:15,317 INFO L87 Difference]: Start difference. First operand 569 states and 852 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:15,677 INFO L93 Difference]: Finished difference Result 1179 states and 1775 transitions. [2024-11-10 06:24:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:24:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 244 [2024-11-10 06:24:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:15,684 INFO L225 Difference]: With dead ends: 1179 [2024-11-10 06:24:15,687 INFO L226 Difference]: Without dead ends: 716 [2024-11-10 06:24:15,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:24:15,691 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 249 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:15,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 779 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:24:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-10 06:24:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 571. [2024-11-10 06:24:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 410 states have (on average 1.3365853658536586) internal successors, (548), 412 states have internal predecessors, (548), 153 states have call successors, (153), 7 states have call predecessors, (153), 7 states have return successors, (153), 151 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-10 06:24:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 854 transitions. [2024-11-10 06:24:15,766 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 854 transitions. Word has length 244 [2024-11-10 06:24:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:15,766 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 854 transitions. [2024-11-10 06:24:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 854 transitions. [2024-11-10 06:24:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-10 06:24:15,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:15,769 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:15,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 06:24:15,770 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:15,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash 127281460, now seen corresponding path program 1 times [2024-11-10 06:24:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:24:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783834484] [2024-11-10 06:24:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:24:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:24:15,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:24:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:24:16,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:24:16,105 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:24:16,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:24:16,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 06:24:16,113 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:16,296 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:24:16,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:24:16 BoogieIcfgContainer [2024-11-10 06:24:16,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:24:16,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:24:16,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:24:16,300 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:24:16,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:00" (3/4) ... [2024-11-10 06:24:16,303 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:24:16,304 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:24:16,305 INFO L158 Benchmark]: Toolchain (without parser) took 17707.93ms. Allocated memory was 176.2MB in the beginning and 417.3MB in the end (delta: 241.2MB). Free memory was 140.4MB in the beginning and 160.6MB in the end (delta: -20.2MB). Peak memory consumption was 221.1MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,305 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:24:16,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.36ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 121.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.82ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,306 INFO L158 Benchmark]: Boogie Preprocessor took 105.72ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 112.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,306 INFO L158 Benchmark]: IcfgBuilder took 909.04ms. Allocated memory is still 176.2MB. Free memory was 112.2MB in the beginning and 118.6MB in the end (delta: -6.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,306 INFO L158 Benchmark]: TraceAbstraction took 16170.07ms. Allocated memory was 176.2MB in the beginning and 417.3MB in the end (delta: 241.2MB). Free memory was 117.5MB in the beginning and 161.6MB in the end (delta: -44.1MB). Peak memory consumption was 200.2MB. Max. memory is 16.1GB. [2024-11-10 06:24:16,307 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 417.3MB. Free memory was 161.6MB in the beginning and 160.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:24:16,308 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.19ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.36ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 121.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.82ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.72ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 112.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 909.04ms. Allocated memory is still 176.2MB. Free memory was 112.2MB in the beginning and 118.6MB in the end (delta: -6.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16170.07ms. Allocated memory was 176.2MB in the beginning and 417.3MB in the end (delta: 241.2MB). Free memory was 117.5MB in the beginning and 161.6MB in the end (delta: -44.1MB). Peak memory consumption was 200.2MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 417.3MB. Free memory was 161.6MB in the beginning and 160.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of bitwiseOr at line 65, overapproximation of bitwiseAnd at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 100.25; [L25] float var_1_4 = 99999999.34; [L26] unsigned short int var_1_5 = 10; [L27] unsigned short int var_1_6 = 8; [L28] unsigned long int var_1_7 = 25; [L29] unsigned char var_1_8 = 0; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 25; [L32] unsigned short int var_1_11 = 10000; [L33] signed short int var_1_12 = -32; [L34] signed char var_1_13 = 4; [L35] signed char var_1_14 = 25; [L36] signed short int var_1_15 = -16; [L37] signed short int var_1_16 = 100; [L38] signed short int var_1_17 = 8; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 0.19999999999999996; [L41] float var_1_20 = 1.5; [L42] float var_1_21 = 10000000.5; [L43] float var_1_22 = 4.5; [L44] float var_1_23 = 4.25; [L45] signed short int var_1_24 = -16; [L46] unsigned short int var_1_25 = 100; [L47] unsigned long int var_1_27 = 8; [L48] double var_1_32 = 1000000.625; [L49] double var_1_33 = 63.5; [L50] signed long int var_1_34 = 8; [L51] unsigned char var_1_36 = 0; [L52] unsigned char var_1_37 = 0; [L53] unsigned char var_1_38 = 1; [L54] float var_1_39 = 10000000000000.5; [L55] float var_1_40 = 99999999999.625; [L56] float var_1_41 = 4.4; [L57] float var_1_42 = 24.5; [L58] float var_1_43 = 0.0; [L59] float var_1_44 = 0.4; [L60] signed long int var_1_45 = -128; [L61] signed short int var_1_46 = 2; VAL [isInitial=0, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_2=1607/8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] FCALL updateLastVariables() [L204] CALL updateVariables() [L132] var_1_2 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L133] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L134] var_1_3 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] var_1_5 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L140] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L141] var_1_6 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_7=25, var_1_8=0, var_1_9=-16] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] var_1_8 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_9=-16] [L145] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_9=-16] [L146] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L146] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] var_1_11 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] var_1_13 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L151] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] var_1_14 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L154] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] var_1_16 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L157] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L159] var_1_17 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] var_1_27 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L173] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] CALL assume_abort_if_not(var_1_27 <= 17) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] RET assume_abort_if_not(var_1_27 <= 17) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_32=8000005/8, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L175] var_1_32 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L176] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_33=127/2, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L177] var_1_33 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L178] RET assume_abort_if_not((var_1_33 >= 0.0F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L179] var_1_37 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L180] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L181] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_40=799999999997/8, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L182] var_1_40 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_41=22/5, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L184] var_1_41 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L185] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_42=49/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L186] var_1_42 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L187] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L188] var_1_43 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L189] RET assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L190] var_1_44 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L191] RET assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L204] RET updateVariables() [L205] CALL step() [L65] EXPR var_1_1 >> var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] EXPR var_1_12 ^ var_1_9 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L65] COND TRUE (var_1_1 >> var_1_27) > ((var_1_12 ^ var_1_9) + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) [L66] var_1_25 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) > (0)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (0))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR var_1_24 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] EXPR ((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L72] COND FALSE !(var_1_10 >= ((((var_1_24 | var_1_27) < 0 ) ? -(var_1_24 | var_1_27) : (var_1_24 | var_1_27)))) [L75] COND TRUE var_1_10 >= var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] COND TRUE var_1_32 > var_1_33 [L77] var_1_34 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] EXPR -10 & var_1_15 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] COND TRUE (-10 & var_1_15) <= var_1_1 [L82] COND TRUE var_1_33 != var_1_32 [L83] var_1_36 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L86] var_1_38 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] COND TRUE var_1_27 == (var_1_12 ^ var_1_12) [L88] var_1_39 = (((((var_1_40) < (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42))))) ? (var_1_40) : (((((var_1_41) < (var_1_42)) ? (var_1_41) : (var_1_42)))))) - (var_1_43 - var_1_44)) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=-128, var_1_46=2, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L92] var_1_45 = var_1_27 [L93] var_1_46 = var_1_27 [L94] var_1_9 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) [L95] signed long int stepLocal_1 = 56016 - var_1_11; [L96] signed long int stepLocal_0 = 10; VAL [isInitial=1, stepLocal_0=10, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L97] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L102] COND FALSE !((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) [L107] var_1_12 = var_1_14 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=-16, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L109] var_1_15 = (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4)))) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L110] COND TRUE var_1_4 > var_1_2 [L111] var_1_18 = (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=32, var_1_24=-16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L119] var_1_24 = 16 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=32, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L120] COND TRUE var_1_18 <= (var_1_3 - var_1_4) [L121] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=-3, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L125] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=-3, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return ((((((((var_1_18 <= (var_1_3 - var_1_4)) ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && (var_1_8 ? ((var_1_5 < 16) ? (var_1_7 == ((unsigned long int) (var_1_6 + var_1_24))) : 1) : 1)) && (var_1_9 == ((signed long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && ((var_1_6 < 10) ? ((var_1_5 < (56016 - var_1_11)) ? (var_1_10 == ((unsigned short int) var_1_5)) : 1) : 1)) && (((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) ? ((! var_1_8) ? (var_1_12 == ((signed short int) var_1_13)) : 1) : (var_1_12 == ((signed short int) var_1_14)))) && (var_1_15 == ((signed short int) (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4))))))) && ((var_1_4 > var_1_2) ? (var_1_18 == ((float) (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21))) : ((! ((var_1_17 - var_1_11) < 128)) ? (var_1_18 == ((float) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_18 == ((float) ((((((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) < ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))) ? (((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) : ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))))))))) && (var_1_24 == ((signed short int) 16)) ; VAL [\result=0, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=-3, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=-3, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=8, var_1_13=-1, var_1_14=8, var_1_15=4, var_1_16=3, var_1_17=0, var_1_1=-3, var_1_24=16, var_1_25=0, var_1_27=4294967296, var_1_34=32, var_1_36=0, var_1_37=0, var_1_38=0, var_1_45=0, var_1_46=0, var_1_5=-3, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 14, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2316 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2235 mSDsluCounter, 7144 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4757 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2968 IncrementalHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 2387 mSDtfsCounter, 2968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1520 GetRequests, 1446 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=571occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 815 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3588 NumberOfCodeBlocks, 3588 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3571 ConstructedInterpolants, 0 QuantifiedInterpolants, 14270 SizeOfPredicates, 2 NumberOfNonLiveVariables, 536 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 35619/35700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:24:16,350 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-ps-co_file-7.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 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:24:18,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:24:18,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:24:18,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:24:18,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:24:19,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:24:19,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:24:19,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:24:19,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:24:19,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:24:19,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:24:19,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:24:19,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:24:19,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:24:19,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:24:19,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:24:19,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:24:19,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:24:19,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:24:19,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:24:19,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:24:19,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:24:19,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:24:19,020 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:24:19,020 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:24:19,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:24:19,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:24:19,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:24:19,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:24:19,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:24:19,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:24:19,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:24:19,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:24:19,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:24:19,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:24:19,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:24:19,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:24:19,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:24:19,025 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:24:19,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:24:19,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:24:19,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:24:19,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:24:19,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:24:19,026 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 -> 93ab9944ae60dcd2ea1c66f43a88f1592af9bef96260d06a583314616c867c3e [2024-11-10 06:24:19,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:24:19,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:24:19,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:24:19,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:24:19,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:24:19,450 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-ps-co_file-7.i [2024-11-10 06:24:21,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:24:21,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:24:21,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-10 06:24:21,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b9eb2ed/563922e834dd4f3a93df751d4e4a302f/FLAGefa72dd81 [2024-11-10 06:24:21,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b9eb2ed/563922e834dd4f3a93df751d4e4a302f [2024-11-10 06:24:21,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:24:21,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:24:21,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:24:21,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:24:21,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:24:21,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:21" (1/1) ... [2024-11-10 06:24:21,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cad7f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:21, skipping insertion in model container [2024-11-10 06:24:21,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:21" (1/1) ... [2024-11-10 06:24:21,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:24:22,037 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-ps-co_file-7.i[918,931] [2024-11-10 06:24:22,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:24:22,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:24:22,165 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-ps-co_file-7.i[918,931] [2024-11-10 06:24:22,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:24:22,239 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:24:22,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22 WrapperNode [2024-11-10 06:24:22,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:24:22,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:24:22,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:24:22,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:24:22,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,307 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-10 06:24:22,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:24:22,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:24:22,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:24:22,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:24:22,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,367 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:24:22,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:24:22,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:24:22,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:24:22,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:24:22,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (1/1) ... [2024-11-10 06:24:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:24:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:24:22,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:24:22,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:24:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:24:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:24:22,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:24:22,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:24:22,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:24:22,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:24:22,627 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:24:22,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:24:26,238 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:24:26,238 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:24:26,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:24:26,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:24:26,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:26 BoogieIcfgContainer [2024-11-10 06:24:26,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:24:26,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:24:26,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:24:26,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:24:26,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:24:21" (1/3) ... [2024-11-10 06:24:26,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2568a155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:26, skipping insertion in model container [2024-11-10 06:24:26,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:22" (2/3) ... [2024-11-10 06:24:26,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2568a155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:24:26, skipping insertion in model container [2024-11-10 06:24:26,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:24:26" (3/3) ... [2024-11-10 06:24:26,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-7.i [2024-11-10 06:24:26,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:24:26,298 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:24:26,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:24:26,378 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;@37e0b521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:24:26,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:24:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 66 states have internal predecessors, (87), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:24:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 06:24:26,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:26,408 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:26,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1790715469, now seen corresponding path program 1 times [2024-11-10 06:24:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171378171] [2024-11-10 06:24:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:26,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:24:26,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:24:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:27,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:24:27,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1080 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:24:27,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:24:27,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:24:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171378171] [2024-11-10 06:24:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171378171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:24:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426961297] [2024-11-10 06:24:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:27,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:24:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:24:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:24:27,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:24:27,279 INFO L87 Difference]: Start difference. First operand has 103 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 66 states have internal predecessors, (87), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:27,321 INFO L93 Difference]: Finished difference Result 198 states and 342 transitions. [2024-11-10 06:24:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:24:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 224 [2024-11-10 06:24:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:27,336 INFO L225 Difference]: With dead ends: 198 [2024-11-10 06:24:27,336 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 06:24:27,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:24:27,344 INFO L432 NwaCegarLoop]: 149 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, 149 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:27,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:24:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 06:24:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 06:24:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:24:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-11-10 06:24:27,396 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 224 [2024-11-10 06:24:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:27,397 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-11-10 06:24:27,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:24:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-11-10 06:24:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 06:24:27,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:27,403 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:27,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:24:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:27,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:27,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:27,609 INFO L85 PathProgramCache]: Analyzing trace with hash 749243810, now seen corresponding path program 1 times [2024-11-10 06:24:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:27,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629503571] [2024-11-10 06:24:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:27,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:24:27,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:24:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:28,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:24:28,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:29,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:24:29,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:24:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629503571] [2024-11-10 06:24:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629503571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:24:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845674138] [2024-11-10 06:24:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:29,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:24:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:29,128 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:30,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:24:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:31,025 INFO L93 Difference]: Finished difference Result 278 states and 428 transitions. [2024-11-10 06:24:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-10 06:24:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:31,031 INFO L225 Difference]: With dead ends: 278 [2024-11-10 06:24:31,031 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 06:24:31,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 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-10 06:24:31,034 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:31,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 289 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 06:24:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 06:24:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2024-11-10 06:24:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:24:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2024-11-10 06:24:31,092 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 224 [2024-11-10 06:24:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:31,098 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2024-11-10 06:24:31,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2024-11-10 06:24:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 06:24:31,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:31,104 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:31,131 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-10 06:24:31,308 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-10 06:24:31,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash 857513241, now seen corresponding path program 1 times [2024-11-10 06:24:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705449303] [2024-11-10 06:24:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:31,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:31,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:31,315 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-10 06:24:31,318 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-10 06:24:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:31,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:24:31,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:32,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:24:32,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:24:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705449303] [2024-11-10 06:24:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705449303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:24:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131883021] [2024-11-10 06:24:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:32,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:24:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:32,581 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:33,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:24:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:33,752 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2024-11-10 06:24:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2024-11-10 06:24:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:33,757 INFO L225 Difference]: With dead ends: 275 [2024-11-10 06:24:33,757 INFO L226 Difference]: Without dead ends: 180 [2024-11-10 06:24:33,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 223 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-10 06:24:33,759 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 21 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 290 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 06:24:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-10 06:24:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2024-11-10 06:24:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:24:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2024-11-10 06:24:33,795 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 225 [2024-11-10 06:24:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:33,796 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2024-11-10 06:24:33,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2024-11-10 06:24:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 06:24:33,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:33,800 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:33,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 06:24:34,004 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-10 06:24:34,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:34,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1683995580, now seen corresponding path program 1 times [2024-11-10 06:24:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299665782] [2024-11-10 06:24:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:34,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:34,015 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-10 06:24:34,017 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-10 06:24:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:34,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:24:34,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:24:37,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:24:37,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:24:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299665782] [2024-11-10 06:24:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299665782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:24:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:24:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:24:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390155675] [2024-11-10 06:24:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:24:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:24:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:24:37,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:24:37,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:24:37,983 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:39,858 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2024-11-10 06:24:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:24:39,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-10 06:24:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:39,865 INFO L225 Difference]: With dead ends: 274 [2024-11-10 06:24:39,865 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 06:24:39,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 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-10 06:24:39,868 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:39,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 268 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 06:24:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 06:24:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-10 06:24:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 98 states have internal predecessors, (119), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:24:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2024-11-10 06:24:39,923 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 226 [2024-11-10 06:24:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:39,926 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2024-11-10 06:24:39,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:24:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2024-11-10 06:24:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-10 06:24:39,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:39,929 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:39,950 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 (5)] Ended with exit code 0 [2024-11-10 06:24:40,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:40,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:40,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1816963016, now seen corresponding path program 1 times [2024-11-10 06:24:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:40,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095134476] [2024-11-10 06:24:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:40,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:40,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:24:40,138 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 (6)] Waiting until timeout for monitored process [2024-11-10 06:24:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:40,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:24:40,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:24:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2024-11-10 06:24:41,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:24:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 75 proven. 27 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-10 06:24:41,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:24:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095134476] [2024-11-10 06:24:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095134476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:24:41,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:24:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-10 06:24:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602186438] [2024-11-10 06:24:41,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:24:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:24:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:24:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:24:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:24:41,912 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-11-10 06:24:47,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:24:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:24:47,689 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2024-11-10 06:24:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 06:24:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) Word has length 227 [2024-11-10 06:24:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:24:47,695 INFO L225 Difference]: With dead ends: 509 [2024-11-10 06:24:47,695 INFO L226 Difference]: Without dead ends: 413 [2024-11-10 06:24:47,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:24:47,697 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 415 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:24:47,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 462 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-10 06:24:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-10 06:24:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2024-11-10 06:24:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 202 states have internal predecessors, (251), 129 states have call successors, (129), 6 states have call predecessors, (129), 6 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2024-11-10 06:24:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2024-11-10 06:24:47,752 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 227 [2024-11-10 06:24:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:24:47,753 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2024-11-10 06:24:47,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (70), 3 states have call predecessors, (70), 5 states have return successors, (70), 4 states have call predecessors, (70), 4 states have call successors, (70) [2024-11-10 06:24:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2024-11-10 06:24:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-10 06:24:47,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:24:47,756 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:24:47,788 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 (6)] Ended with exit code 0 [2024-11-10 06:24:47,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:47,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:24:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:24:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1075197020, now seen corresponding path program 1 times [2024-11-10 06:24:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:24:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187306348] [2024-11-10 06:24:47,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:24:47,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:24:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:24:47,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:24:47,962 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 (7)] Waiting until timeout for monitored process [2024-11-10 06:24:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:24:48,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 06:24:48,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:25:14,324 WARN L286 SmtUtils]: Spent 11.32s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)