./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.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 f6d0673cf69fd7af24a73adc82b5591f8f7bdc0326d87467cf45e63fbcf1c96a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:16:41,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:16:41,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:16:41,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:16:41,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:16:41,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:16:41,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:16:41,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:16:41,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:16:41,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:16:41,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:16:41,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:16:41,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:16:41,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:16:41,649 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:16:41,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:16:41,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:16:41,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:16:41,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:16:41,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:16:41,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:16:41,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:16:41,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:16:41,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:16:41,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:16:41,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:16:41,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:16:41,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:16:41,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:16:41,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:16:41,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:16:41,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:16:41,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:16:41,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:16:41,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:16:41,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:16:41,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:16:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:16:41,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:16:41,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:16:41,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:16:41,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:16:41,668 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 -> f6d0673cf69fd7af24a73adc82b5591f8f7bdc0326d87467cf45e63fbcf1c96a [2024-10-14 12:16:42,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:16:42,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:16:42,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:16:42,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:16:42,047 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:16:42,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i [2024-10-14 12:16:43,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:16:43,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:16:43,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i [2024-10-14 12:16:43,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5e2994a/743477b4a61a4a96a02820692b88ee59/FLAGd26a556c1 [2024-10-14 12:16:44,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5e2994a/743477b4a61a4a96a02820692b88ee59 [2024-10-14 12:16:44,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:16:44,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:16:44,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:16:44,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:16:44,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:16:44,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bcad3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44, skipping insertion in model container [2024-10-14 12:16:44,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:16:44,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i[916,929] [2024-10-14 12:16:44,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:16:44,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:16:44,676 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i[916,929] [2024-10-14 12:16:44,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:16:44,770 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:16:44,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44 WrapperNode [2024-10-14 12:16:44,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:16:44,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:16:44,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:16:44,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:16:44,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,843 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-14 12:16:44,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:16:44,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:16:44,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:16:44,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:16:44,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,890 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:16:44,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:16:44,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:16:44,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:16:44,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:16:44,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (1/1) ... [2024-10-14 12:16:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:16:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:16:44,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:16:44,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:16:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:16:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:16:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:16:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:16:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:16:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:16:45,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:16:45,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:16:45,599 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 12:16:45,600 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:16:45,682 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:16:45,683 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:16:45,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:16:45 BoogieIcfgContainer [2024-10-14 12:16:45,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:16:45,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:16:45,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:16:45,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:16:45,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:16:44" (1/3) ... [2024-10-14 12:16:45,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:16:45, skipping insertion in model container [2024-10-14 12:16:45,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:16:44" (2/3) ... [2024-10-14 12:16:45,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:16:45, skipping insertion in model container [2024-10-14 12:16:45,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:16:45" (3/3) ... [2024-10-14 12:16:45,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-25.i [2024-10-14 12:16:45,714 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:16:45,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:16:45,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:16:45,795 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;@1c0bf37a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:16:45,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:16:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:16:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 12:16:45,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:45,827 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:45,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1252905248, now seen corresponding path program 1 times [2024-10-14 12:16:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827499012] [2024-10-14 12:16:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827499012] [2024-10-14 12:16:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827499012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:16:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571331264] [2024-10-14 12:16:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:46,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:16:46,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:46,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:16:46,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:16:46,568 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:16:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:46,633 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2024-10-14 12:16:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:16:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-14 12:16:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:46,651 INFO L225 Difference]: With dead ends: 153 [2024-10-14 12:16:46,651 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 12:16:46,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:16:46,658 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:46,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:16:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 12:16:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 12:16:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:16:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-14 12:16:46,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 160 [2024-10-14 12:16:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:46,710 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-14 12:16:46,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:16:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-14 12:16:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 12:16:46,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:46,717 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:16:46,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1700195672, now seen corresponding path program 1 times [2024-10-14 12:16:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88422846] [2024-10-14 12:16:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:47,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88422846] [2024-10-14 12:16:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88422846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:47,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:16:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180872836] [2024-10-14 12:16:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:47,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:16:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:47,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:16:47,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:16:47,161 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:47,244 INFO L93 Difference]: Finished difference Result 180 states and 277 transitions. [2024-10-14 12:16:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:16:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-14 12:16:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:47,253 INFO L225 Difference]: With dead ends: 180 [2024-10-14 12:16:47,253 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 12:16:47,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10-14 12:16:47,259 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:47,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 221 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:16:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 12:16:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-10-14 12:16:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:16:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-10-14 12:16:47,288 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 160 [2024-10-14 12:16:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:47,291 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-10-14 12:16:47,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-10-14 12:16:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:47,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:47,298 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:47,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:16:47,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1888510991, now seen corresponding path program 1 times [2024-10-14 12:16:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253553108] [2024-10-14 12:16:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:48,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253553108] [2024-10-14 12:16:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253553108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:16:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031766346] [2024-10-14 12:16:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:48,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:16:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:16:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:16:48,568 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:49,204 INFO L93 Difference]: Finished difference Result 355 states and 544 transitions. [2024-10-14 12:16:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 12:16:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:16:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:49,214 INFO L225 Difference]: With dead ends: 355 [2024-10-14 12:16:49,214 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 12:16:49,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:16:49,216 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 152 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:49,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 480 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 12:16:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 12:16:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 163. [2024-10-14 12:16:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 112 states have internal predecessors, (155), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:16:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 251 transitions. [2024-10-14 12:16:49,270 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 251 transitions. Word has length 161 [2024-10-14 12:16:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:49,273 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 251 transitions. [2024-10-14 12:16:49,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2024-10-14 12:16:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:49,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:49,279 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:49,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:16:49,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:49,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1889303281, now seen corresponding path program 1 times [2024-10-14 12:16:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242427220] [2024-10-14 12:16:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242427220] [2024-10-14 12:16:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242427220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:16:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913379233] [2024-10-14 12:16:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:50,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:16:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:16:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:16:50,403 INFO L87 Difference]: Start difference. First operand 163 states and 251 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:51,197 INFO L93 Difference]: Finished difference Result 355 states and 542 transitions. [2024-10-14 12:16:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:16:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:16:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:51,201 INFO L225 Difference]: With dead ends: 355 [2024-10-14 12:16:51,201 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 12:16:51,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:16:51,203 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 145 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:51,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 549 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 12:16:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 12:16:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2024-10-14 12:16:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 114 states have internal predecessors, (157), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:16:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 253 transitions. [2024-10-14 12:16:51,225 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 253 transitions. Word has length 161 [2024-10-14 12:16:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:51,226 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 253 transitions. [2024-10-14 12:16:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2024-10-14 12:16:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:51,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:51,229 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:51,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:16:51,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:51,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1079956655, now seen corresponding path program 1 times [2024-10-14 12:16:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433165962] [2024-10-14 12:16:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433165962] [2024-10-14 12:16:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433165962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:16:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224826973] [2024-10-14 12:16:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:16:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:16:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:16:51,753 INFO L87 Difference]: Start difference. First operand 165 states and 253 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:51,817 INFO L93 Difference]: Finished difference Result 346 states and 525 transitions. [2024-10-14 12:16:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:16:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:16:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:51,821 INFO L225 Difference]: With dead ends: 346 [2024-10-14 12:16:51,821 INFO L226 Difference]: Without dead ends: 231 [2024-10-14 12:16:51,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:16:51,822 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:51,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 268 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:16:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-14 12:16:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2024-10-14 12:16:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.3888888888888888) internal successors, (225), 163 states have internal predecessors, (225), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 12:16:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2024-10-14 12:16:51,850 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 161 [2024-10-14 12:16:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:51,851 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2024-10-14 12:16:51,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2024-10-14 12:16:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:51,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:51,855 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:16:51,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650291, now seen corresponding path program 1 times [2024-10-14 12:16:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441252321] [2024-10-14 12:16:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441252321] [2024-10-14 12:16:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441252321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:16:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251372588] [2024-10-14 12:16:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:52,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:16:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:16:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:16:52,295 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:52,641 INFO L93 Difference]: Finished difference Result 492 states and 737 transitions. [2024-10-14 12:16:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:16:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:16:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:52,649 INFO L225 Difference]: With dead ends: 492 [2024-10-14 12:16:52,650 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 12:16:52,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:16:52,653 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 207 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:52,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 372 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:16:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 12:16:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 275. [2024-10-14 12:16:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 220 states have (on average 1.4136363636363636) internal successors, (311), 221 states have internal predecessors, (311), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 12:16:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 411 transitions. [2024-10-14 12:16:52,692 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 411 transitions. Word has length 161 [2024-10-14 12:16:52,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:52,693 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 411 transitions. [2024-10-14 12:16:52,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 411 transitions. [2024-10-14 12:16:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:52,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:52,696 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:52,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:16:52,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:52,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1302497267, now seen corresponding path program 1 times [2024-10-14 12:16:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132817296] [2024-10-14 12:16:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132817296] [2024-10-14 12:16:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132817296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:16:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96996271] [2024-10-14 12:16:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:16:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:53,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:16:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:16:53,118 INFO L87 Difference]: Start difference. First operand 275 states and 411 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:53,461 INFO L93 Difference]: Finished difference Result 492 states and 734 transitions. [2024-10-14 12:16:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:16:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:16:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:53,465 INFO L225 Difference]: With dead ends: 492 [2024-10-14 12:16:53,465 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 12:16:53,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:16:53,467 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 169 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:53,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 598 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:16:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 12:16:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 251. [2024-10-14 12:16:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 197 states have internal predecessors, (273), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 12:16:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2024-10-14 12:16:53,489 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 161 [2024-10-14 12:16:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:53,489 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2024-10-14 12:16:53,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:16:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2024-10-14 12:16:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:53,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:53,491 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:16:53,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:53,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 493150641, now seen corresponding path program 1 times [2024-10-14 12:16:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855339154] [2024-10-14 12:16:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:16:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:16:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:16:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:16:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:16:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:16:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:16:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:16:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:16:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:16:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:16:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:16:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:16:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 12:16:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 12:16:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 12:16:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 12:16:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 12:16:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:55,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 12:16:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 12:16:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 12:16:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 12:16:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 12:16:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 12:16:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:16:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:16:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:16:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855339154] [2024-10-14 12:16:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855339154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:16:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:16:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 12:16:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523853298] [2024-10-14 12:16:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:16:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 12:16:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:16:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 12:16:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:16:56,075 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:16:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:16:57,684 INFO L93 Difference]: Finished difference Result 624 states and 902 transitions. [2024-10-14 12:16:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 12:16:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-14 12:16:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:16:57,688 INFO L225 Difference]: With dead ends: 624 [2024-10-14 12:16:57,688 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 12:16:57,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-14 12:16:57,692 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 306 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 12:16:57,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 758 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 12:16:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 12:16:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 283. [2024-10-14 12:16:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 228 states have (on average 1.3859649122807018) internal successors, (316), 229 states have internal predecessors, (316), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-14 12:16:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2024-10-14 12:16:57,728 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 161 [2024-10-14 12:16:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:16:57,729 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2024-10-14 12:16:57,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:16:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2024-10-14 12:16:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:16:57,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:16:57,732 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 12:16:57,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:16:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:16:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 550408943, now seen corresponding path program 1 times [2024-10-14 12:16:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:16:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928070605] [2024-10-14 12:16:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:16:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:16:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978807846] [2024-10-14 12:16:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:16:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:16:57,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:16:57,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:16:57,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 12:16:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:16:58,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:16:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:16:58,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:16:58,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:16:58,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:16:58,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:16:58,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:16:58,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:16:58,731 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:16:58,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:16:58 BoogieIcfgContainer [2024-10-14 12:16:58,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:16:58,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:16:58,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:16:58,735 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:16:58,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:16:45" (3/4) ... [2024-10-14 12:16:58,737 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:16:58,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:16:58,739 INFO L158 Benchmark]: Toolchain (without parser) took 14460.57ms. Allocated memory was 138.4MB in the beginning and 339.7MB in the end (delta: 201.3MB). Free memory was 82.3MB in the beginning and 169.9MB in the end (delta: -87.6MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,739 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:16:58,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.74ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 82.1MB in the beginning and 158.5MB in the end (delta: -76.4MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.04ms. Allocated memory is still 190.8MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,740 INFO L158 Benchmark]: Boogie Preprocessor took 83.70ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 147.8MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,740 INFO L158 Benchmark]: RCFGBuilder took 753.06ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 112.4MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,741 INFO L158 Benchmark]: TraceAbstraction took 13047.81ms. Allocated memory was 190.8MB in the beginning and 339.7MB in the end (delta: 148.9MB). Free memory was 112.4MB in the beginning and 169.9MB in the end (delta: -57.5MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-10-14 12:16:58,741 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 339.7MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:16:58,742 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.21ms. Allocated memory is still 138.4MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.74ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 82.1MB in the beginning and 158.5MB in the end (delta: -76.4MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.04ms. Allocated memory is still 190.8MB. Free memory was 158.5MB in the beginning and 154.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.70ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 147.8MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 753.06ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 112.4MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13047.81ms. Allocated memory was 190.8MB in the beginning and 339.7MB in the end (delta: 148.9MB). Free memory was 112.4MB in the beginning and 169.9MB in the end (delta: -57.5MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 339.7MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -256; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] double var_1_7 = 256.25; [L27] double var_1_8 = 127.8; [L28] signed short int var_1_10 = -2; [L29] signed short int var_1_11 = 5; [L30] signed short int var_1_12 = 16; [L31] unsigned long int var_1_13 = 1000000000; [L32] signed long int var_1_14 = -100000000; [L33] double var_1_16 = 50.8; [L34] double var_1_17 = 2.2; [L35] double var_1_18 = 2.675; [L36] double var_1_19 = 100.5; [L37] unsigned short int var_1_20 = 46250; [L38] double var_1_21 = 99999999999.75; [L39] double var_1_22 = 32.4; [L40] double var_1_23 = 15.25; [L41] signed short int var_1_24 = -100; [L42] signed char var_1_25 = -1; [L43] unsigned short int var_1_26 = 128; [L44] unsigned long int var_1_27 = 8; [L45] signed short int var_1_28 = -4; [L46] unsigned long int var_1_29 = 100; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int var_1_31 = 1000000000; [L49] double var_1_32 = 0.0; [L50] signed long int last_1_var_1_1 = -64; [L51] signed long int last_1_var_1_14 = -100000000; [L52] double last_1_var_1_16 = 50.8; [L53] signed short int last_1_var_1_24 = -100; [L54] signed short int last_1_var_1_28 = -4; [L55] unsigned long int last_1_var_1_29 = 100; [L56] unsigned long int last_1_var_1_30 = 100; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_14 = var_1_14 [L186] last_1_var_1_16 = var_1_16 [L187] last_1_var_1_24 = var_1_24 [L188] last_1_var_1_28 = var_1_28 [L189] last_1_var_1_29 = var_1_29 [L190] last_1_var_1_30 = var_1_30 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L148] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L148] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L150] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L152] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L153] var_1_10 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_10 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L154] RET assume_abort_if_not(var_1_10 >= -16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L156] var_1_11 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L157] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L159] var_1_12 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L162] var_1_17 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L164] var_1_18 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L165] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L167] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] 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, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L170] 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, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L171] var_1_22 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L172] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L173] var_1_23 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L174] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L175] var_1_25 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_25 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L176] RET assume_abort_if_not(var_1_25 >= -128) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] CALL assume_abort_if_not(var_1_25 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] RET assume_abort_if_not(var_1_25 != 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L179] var_1_31 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_31 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L180] RET assume_abort_if_not(var_1_31 >= 536870912) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L201] RET updateVariables() [L202] CALL step() [L60] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_2=0, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L61] COND FALSE !(var_1_5 && stepLocal_2) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L64] COND FALSE !((var_1_7 - var_1_8) > last_1_var_1_16) [L67] var_1_4 = (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24)))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L70] unsigned char stepLocal_6 = (var_1_12 / var_1_25) != (last_1_var_1_1 * 16); VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_6=1, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L71] COND FALSE !(stepLocal_6 && var_1_6) [L78] var_1_26 = last_1_var_1_29 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L80] signed long int stepLocal_5 = var_1_20 / var_1_25; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_5=6575, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=-100, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L81] COND TRUE stepLocal_5 > var_1_26 [L82] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] unsigned short int stepLocal_7 = var_1_26; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_7=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L85] COND TRUE (last_1_var_1_28 + (- var_1_10)) > stepLocal_7 [L86] var_1_28 = (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L88] signed long int stepLocal_4 = 128; [L89] signed short int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_3=0, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32879, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L90] COND FALSE !(var_1_26 <= stepLocal_3) [L97] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=0, var_1_5=0, var_1_6=0] [L99] COND TRUE (~ var_1_11) >= (~ var_1_20) [L100] var_1_32 = var_1_17 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L102] COND FALSE !(\read(var_1_6)) [L105] var_1_14 = (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=1000000000, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L107] var_1_13 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L108] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L113] signed long int stepLocal_1 = var_1_14; [L114] signed long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_1=99999903, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L115] COND FALSE !(! (var_1_14 >= var_1_4)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_1=99999903, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L120] COND FALSE !(var_1_4 >= stepLocal_1) [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L126] var_1_29 = (var_1_1 + 4u) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L127] COND FALSE !((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_4=128, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L130] unsigned long int stepLocal_9 = var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12))); [L131] unsigned char stepLocal_8 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_4=128, stepLocal_8=0, stepLocal_9=32875, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L132] COND FALSE !(stepLocal_8 || var_1_5) [L139] var_1_30 = ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999903, stepLocal_4=128, stepLocal_9=32875, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((((((((! (var_1_14 >= var_1_4)) ? ((256 != var_1_14) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_14))) : 1) : ((var_1_4 >= var_1_14) ? (var_1_1 == ((signed long int) var_1_14)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_5 && var_1_6) ? (var_1_4 == ((signed short int) ((((last_1_var_1_24) < (-100)) ? (last_1_var_1_24) : (-100))))) : (((var_1_7 - var_1_8) > last_1_var_1_16) ? (var_1_4 == ((signed short int) ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))))) : (var_1_4 == ((signed short int) (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24))))))))) && (var_1_13 == ((unsigned long int) (var_1_14 + var_1_12)))) && (var_1_6 ? (var_1_14 == ((signed long int) (var_1_4 - last_1_var_1_14))) : (var_1_14 == ((signed long int) (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)))))) && (((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) ? (var_1_16 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_26 <= var_1_4) ? (((var_1_26 / (var_1_20 - 25)) >= 128) ? (var_1_19 == ((double) (((((15.25 - var_1_21) < 0 ) ? -(15.25 - var_1_21) : (15.25 - var_1_21))) - (var_1_22 + var_1_23)))) : (var_1_19 == ((double) var_1_22))) : (var_1_19 == ((double) var_1_22)))) && (((var_1_20 / var_1_25) > var_1_26) ? (var_1_24 == ((signed short int) var_1_11)) : 1)) && ((((var_1_12 / var_1_25) != (last_1_var_1_1 * 16)) && var_1_6) ? (var_1_6 ? (var_1_26 == ((unsigned short int) var_1_12)) : (var_1_26 == ((unsigned short int) last_1_var_1_29))) : (var_1_26 == ((unsigned short int) last_1_var_1_29)))) && (var_1_5 ? (((var_1_12 * var_1_13) >= var_1_11) ? (var_1_27 == ((unsigned long int) var_1_26)) : 1) : 1)) && (((last_1_var_1_28 + (- var_1_10)) > var_1_26) ? (var_1_28 == ((signed short int) (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26))) : 1)) && (var_1_29 == ((unsigned long int) (var_1_1 + 4u)))) && ((var_1_6 || var_1_5) ? (((var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12)))) >= var_1_11) ? (var_1_30 == ((unsigned long int) var_1_29)) : (var_1_30 == ((unsigned long int) (((((var_1_20) > (var_1_4)) ? (var_1_20) : (var_1_4))) + ((1000000000u + var_1_31) - var_1_29))))) : (var_1_30 == ((unsigned long int) ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))))))) && (((~ var_1_11) >= (~ var_1_20)) ? (var_1_32 == ((double) var_1_17)) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-196, var_1_11=2, var_1_12=3, var_1_13=99999906, var_1_14=99999903, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=0, var_1_20=32879, var_1_22=2, var_1_24=2, var_1_25=5, var_1_26=100, var_1_27=8, var_1_28=-98, var_1_29=4, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1049 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 3360 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2240 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1459 IncrementalHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 1120 mSDtfsCounter, 1459 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 591 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1608 NumberOfCodeBlocks, 1608 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 10700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 8832/8832 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 12:16:58,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.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 f6d0673cf69fd7af24a73adc82b5591f8f7bdc0326d87467cf45e63fbcf1c96a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:17:01,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:17:01,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:17:01,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:17:01,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:17:01,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:17:01,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:17:01,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:17:01,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:17:01,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:17:01,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:17:01,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:17:01,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:17:01,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:17:01,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:17:01,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:17:01,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:17:01,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:17:01,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:17:01,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:17:01,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:17:01,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:17:01,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:17:01,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:17:01,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:17:01,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:17:01,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:17:01,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:17:01,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:17:01,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:17:01,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:17:01,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:17:01,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:17:01,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:17:01,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:17:01,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:17:01,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:17:01,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:17:01,280 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:17:01,280 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:17:01,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:17:01,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:17:01,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:17:01,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:17:01,282 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:17:01,282 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 -> f6d0673cf69fd7af24a73adc82b5591f8f7bdc0326d87467cf45e63fbcf1c96a [2024-10-14 12:17:01,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:17:01,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:17:01,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:17:01,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:17:01,668 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:17:01,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i [2024-10-14 12:17:03,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:17:03,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:17:03,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i [2024-10-14 12:17:03,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eec41e0/9384c4252a604db9b3e0f47534664dc9/FLAG2ebe8901c [2024-10-14 12:17:03,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13eec41e0/9384c4252a604db9b3e0f47534664dc9 [2024-10-14 12:17:03,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:17:03,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:17:03,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:17:03,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:17:03,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:17:03,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:17:03" (1/1) ... [2024-10-14 12:17:03,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27519c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:03, skipping insertion in model container [2024-10-14 12:17:03,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:17:03" (1/1) ... [2024-10-14 12:17:03,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:17:03,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i[916,929] [2024-10-14 12:17:04,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:17:04,035 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:17:04,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-25.i[916,929] [2024-10-14 12:17:04,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:17:04,143 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:17:04,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04 WrapperNode [2024-10-14 12:17:04,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:17:04,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:17:04,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:17:04,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:17:04,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,222 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-14 12:17:04,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:17:04,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:17:04,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:17:04,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:17:04,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:17:04,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:17:04,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:17:04,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:17:04,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:17:04,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (1/1) ... [2024-10-14 12:17:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:17:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:17:04,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:17:04,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:17:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:17:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:17:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:17:04,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:17:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:17:04,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:17:04,585 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:17:04,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:17:11,856 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 12:17:11,856 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:17:11,953 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:17:11,957 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:17:11,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:17:11 BoogieIcfgContainer [2024-10-14 12:17:11,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:17:11,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:17:11,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:17:11,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:17:11,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:17:03" (1/3) ... [2024-10-14 12:17:11,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b43a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:17:11, skipping insertion in model container [2024-10-14 12:17:11,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:17:04" (2/3) ... [2024-10-14 12:17:11,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b43a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:17:11, skipping insertion in model container [2024-10-14 12:17:11,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:17:11" (3/3) ... [2024-10-14 12:17:11,969 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-25.i [2024-10-14 12:17:11,987 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:17:11,988 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:17:12,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:17:12,083 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;@384b49a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:17:12,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:17:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:17:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 12:17:12,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:17:12,105 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:17:12,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:17:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:17:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1252905248, now seen corresponding path program 1 times [2024-10-14 12:17:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:17:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815391139] [2024-10-14 12:17:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:17:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:17:12,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:17:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 12:17:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:17:12,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:17:12,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:17:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-14 12:17:12,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:17:12,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:17:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815391139] [2024-10-14 12:17:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815391139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:17:12,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:17:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:17:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686599295] [2024-10-14 12:17:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:17:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:17:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:17:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:17:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:17:12,830 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:17:16,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:17:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:17:16,529 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2024-10-14 12:17:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:17:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-14 12:17:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:17:16,598 INFO L225 Difference]: With dead ends: 153 [2024-10-14 12:17:16,599 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 12:17:16,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:17:16,605 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 12:17:16,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 12:17:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 12:17:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 12:17:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:17:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-14 12:17:16,653 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 160 [2024-10-14 12:17:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:17:16,654 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-14 12:17:16,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 12:17:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-14 12:17:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 12:17:16,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:17:16,658 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:17:16,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 12:17:16,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:16,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:17:16,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:17:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1700195672, now seen corresponding path program 1 times [2024-10-14 12:17:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:17:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70517100] [2024-10-14 12:17:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:17:16,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:17:16,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:17:16,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 12:17:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:17:17,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 12:17:17,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:17:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:17:17,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:17:17,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:17:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70517100] [2024-10-14 12:17:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70517100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:17:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:17:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:17:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632436763] [2024-10-14 12:17:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:17:17,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:17:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:17:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:17:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:17:17,685 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:17:21,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:17:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:17:21,619 INFO L93 Difference]: Finished difference Result 180 states and 277 transitions. [2024-10-14 12:17:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:17:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-14 12:17:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:17:21,671 INFO L225 Difference]: With dead ends: 180 [2024-10-14 12:17:21,671 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 12:17:21,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 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-10-14 12:17:21,674 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 12:17:21,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 220 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 12:17:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 12:17:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-10-14 12:17:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:17:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-10-14 12:17:21,691 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 160 [2024-10-14 12:17:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:17:21,694 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-10-14 12:17:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:17:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-10-14 12:17:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:17:21,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:17:21,699 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:17:21,721 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 (3)] Ended with exit code 0 [2024-10-14 12:17:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:21,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:17:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:17:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1888510991, now seen corresponding path program 1 times [2024-10-14 12:17:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:17:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440039769] [2024-10-14 12:17:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:17:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:21,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:17:21,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:17:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 12:17:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:17:22,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 12:17:22,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:17:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-10-14 12:17:25,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:17:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 12:17:26,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:17:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440039769] [2024-10-14 12:17:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440039769] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 12:17:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 12:17:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 12:17:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590583318] [2024-10-14 12:17:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:17:26,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:17:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:17:26,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:17:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:17:26,247 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:17:30,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:17:32,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:17:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:17:32,998 INFO L93 Difference]: Finished difference Result 248 states and 379 transitions. [2024-10-14 12:17:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:17:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 12:17:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:17:33,007 INFO L225 Difference]: With dead ends: 248 [2024-10-14 12:17:33,007 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 12:17:33,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:17:33,013 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 39 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:17:33,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 355 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2024-10-14 12:17:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 12:17:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2024-10-14 12:17:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 112 states have internal predecessors, (158), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 12:17:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2024-10-14 12:17:33,039 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 161 [2024-10-14 12:17:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:17:33,040 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2024-10-14 12:17:33,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 12:17:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2024-10-14 12:17:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 12:17:33,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:17:33,044 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:17:33,068 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-10-14 12:17:33,245 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-10-14 12:17:33,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:17:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:17:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1819650291, now seen corresponding path program 1 times [2024-10-14 12:17:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:17:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574875225] [2024-10-14 12:17:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:17:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:17:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:17:33,252 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-10-14 12:17:33,253 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-10-14 12:17:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:17:33,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 12:17:33,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:17:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 624 proven. 87 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-14 12:17:51,556 INFO L311 TraceCheckSpWp]: Computing backward predicates...