./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_loopvsstraightlinecode_100-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:16:28,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:16:28,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:16:28,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:16:28,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:16:28,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:16:28,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:16:28,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:16:28,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:16:28,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:16:28,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:16:28,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:16:28,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:16:28,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:16:28,654 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:16:28,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:16:28,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:16:28,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:16:28,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:16:28,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:16:28,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:16:28,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:16:28,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:16:28,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:16:28,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:16:28,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:16:28,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:16:28,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:16:28,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:16:28,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:16:28,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:16:28,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:16:28,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:28,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:16:28,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:16:28,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:16:28,664 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-clean/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-clean/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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-10-11 11:16:28,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:16:28,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:16:28,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:16:28,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:16:28,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:16:28,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:30,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:16:30,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:16:30,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:30,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2915df138/f7eb042316184c5fb402c14ce439a07a/FLAGe6b57e07c [2024-10-11 11:16:30,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2915df138/f7eb042316184c5fb402c14ce439a07a [2024-10-11 11:16:30,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:16:30,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:16:30,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:30,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:16:30,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:16:30,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:30" (1/1) ... [2024-10-11 11:16:30,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38032ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:30, skipping insertion in model container [2024-10-11 11:16:30,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:30" (1/1) ... [2024-10-11 11:16:30,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:16:30,897 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-10-11 11:16:30,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:30,991 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:16:31,002 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-10-11 11:16:31,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:31,053 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:16:31,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31 WrapperNode [2024-10-11 11:16:31,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:31,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:31,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:16:31,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:16:31,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,101 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-11 11:16:31,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:31,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:16:31,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:16:31,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:16:31,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:16:31,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:16:31,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:16:31,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:16:31,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:16:31,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (1/1) ... [2024-10-11 11:16:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:31,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:16:31,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:16:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:16:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:16:31,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:16:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:16:31,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:16:31,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:16:31,374 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:16:31,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:16:31,788 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:16:31,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:16:31,823 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:16:31,823 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:16:31,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:31 BoogieIcfgContainer [2024-10-11 11:16:31,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:16:31,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:16:31,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:16:31,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:16:31,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:16:30" (1/3) ... [2024-10-11 11:16:31,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4234e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:31, skipping insertion in model container [2024-10-11 11:16:31,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:31" (2/3) ... [2024-10-11 11:16:31,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b4234e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:31, skipping insertion in model container [2024-10-11 11:16:31,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:31" (3/3) ... [2024-10-11 11:16:31,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:31,846 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:16:31,847 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:16:31,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:16:31,904 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;@43691f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:16:31,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:16:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 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-11 11:16:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:16:31,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:31,920 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, 1] [2024-10-11 11:16:31,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1283451489, now seen corresponding path program 1 times [2024-10-11 11:16:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22374917] [2024-10-11 11:16:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:32,365 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-11 11:16:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:32,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22374917] [2024-10-11 11:16:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22374917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:16:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304805806] [2024-10-11 11:16:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:16:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:16:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:16:32,418 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11 11:16:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:32,461 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-11 11:16:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:16:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 162 [2024-10-11 11:16:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:32,471 INFO L225 Difference]: With dead ends: 165 [2024-10-11 11:16:32,471 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 11:16:32,475 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-11 11:16:32,478 INFO L432 NwaCegarLoop]: 124 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, 124 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-11 11:16:32,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:16:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 11:16:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 11:16:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 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-11 11:16:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 11:16:32,524 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 162 [2024-10-11 11:16:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:32,524 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 11:16:32,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11 11:16:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 11:16:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:16:32,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:32,532 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, 1] [2024-10-11 11:16:32,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:16:32,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:32,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 808559315, now seen corresponding path program 1 times [2024-10-11 11:16:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:32,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28075550] [2024-10-11 11:16:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:16:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28075550] [2024-10-11 11:16:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28075550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:16:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822856668] [2024-10-11 11:16:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:33,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:16:33,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:16:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:16:33,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-11 11:16:33,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:16:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:16:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822856668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:16:33,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:16:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-10-11 11:16:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111568364] [2024-10-11 11:16:33,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:16:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:16:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:33,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:16:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:16:33,972 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-11 11:16:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:34,372 INFO L93 Difference]: Finished difference Result 175 states and 263 transitions. [2024-10-11 11:16:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:16:34,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 162 [2024-10-11 11:16:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:34,375 INFO L225 Difference]: With dead ends: 175 [2024-10-11 11:16:34,375 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:16:34,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-11 11:16:34,377 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 167 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:34,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 234 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:16:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:16:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-11 11:16:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:16:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2024-10-11 11:16:34,405 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 162 [2024-10-11 11:16:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:34,406 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2024-10-11 11:16:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-10-11 11:16:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2024-10-11 11:16:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:16:34,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:34,410 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, 1, 1] [2024-10-11 11:16:34,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:16:34,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:34,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:34,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1663460783, now seen corresponding path program 1 times [2024-10-11 11:16:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:34,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592794376] [2024-10-11 11:16:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:34,918 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-11 11:16:34,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592794376] [2024-10-11 11:16:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592794376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:16:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546848423] [2024-10-11 11:16:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:16:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:16:34,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:16:34,921 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11 11:16:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:35,032 INFO L93 Difference]: Finished difference Result 252 states and 357 transitions. [2024-10-11 11:16:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:16:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 163 [2024-10-11 11:16:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:35,036 INFO L225 Difference]: With dead ends: 252 [2024-10-11 11:16:35,036 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 11:16:35,037 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-11 11:16:35,037 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:35,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 271 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:16:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 11:16:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 105. [2024-10-11 11:16:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:16:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-10-11 11:16:35,063 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 163 [2024-10-11 11:16:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:35,065 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-10-11 11:16:35,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11 11:16:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-10-11 11:16:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:16:35,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:35,069 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, 1, 1] [2024-10-11 11:16:35,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:16:35,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 652343533, now seen corresponding path program 1 times [2024-10-11 11:16:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994789864] [2024-10-11 11:16:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:16:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994789864] [2024-10-11 11:16:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994789864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:16:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019019297] [2024-10-11 11:16:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:35,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:35,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:16:35,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:16:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:35,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:16:35,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-11 11:16:35,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:16:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:16:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019019297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:16:35,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:16:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:16:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525301598] [2024-10-11 11:16:35,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:16:35,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:16:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:16:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:16:35,747 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:16:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:35,908 INFO L93 Difference]: Finished difference Result 219 states and 302 transitions. [2024-10-11 11:16:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:16:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 163 [2024-10-11 11:16:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:35,910 INFO L225 Difference]: With dead ends: 219 [2024-10-11 11:16:35,910 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:16:35,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:16:35,911 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 123 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:35,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 226 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:16:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:16:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-10-11 11:16:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:16:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2024-10-11 11:16:35,927 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 163 [2024-10-11 11:16:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:35,927 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2024-10-11 11:16:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:16:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2024-10-11 11:16:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:16:35,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:35,929 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, 1, 1] [2024-10-11 11:16:35,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:16:36,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:36,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1529447277, now seen corresponding path program 1 times [2024-10-11 11:16:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016576691] [2024-10-11 11:16:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 186 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-10-11 11:16:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:37,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016576691] [2024-10-11 11:16:37,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016576691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:16:37,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098229555] [2024-10-11 11:16:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:37,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:37,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:16:37,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:16:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:37,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 11:16:37,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 157 proven. 186 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-11 11:16:38,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:16:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 11:16:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098229555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:16:39,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:16:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 27 [2024-10-11 11:16:39,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978468264] [2024-10-11 11:16:39,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:16:39,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 11:16:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:39,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 11:16:39,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-10-11 11:16:39,157 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 26 states have internal predecessors, (132), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2024-10-11 11:16:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:42,220 INFO L93 Difference]: Finished difference Result 411 states and 541 transitions. [2024-10-11 11:16:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 11:16:42,220 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 26 states have internal predecessors, (132), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) Word has length 163 [2024-10-11 11:16:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:42,222 INFO L225 Difference]: With dead ends: 411 [2024-10-11 11:16:42,223 INFO L226 Difference]: Without dead ends: 314 [2024-10-11 11:16:42,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1017, Invalid=3813, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 11:16:42,225 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 407 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:42,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 955 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 11:16:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-11 11:16:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 209. [2024-10-11 11:16:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 146 states have internal predecessors, (181), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:16:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 277 transitions. [2024-10-11 11:16:42,258 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 277 transitions. Word has length 163 [2024-10-11 11:16:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:42,258 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 277 transitions. [2024-10-11 11:16:42,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.888888888888889) internal successors, (132), 26 states have internal predecessors, (132), 7 states have call successors, (70), 4 states have call predecessors, (70), 8 states have return successors, (71), 7 states have call predecessors, (71), 7 states have call successors, (71) [2024-10-11 11:16:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 277 transitions. [2024-10-11 11:16:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 11:16:42,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:42,260 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, 1, 1] [2024-10-11 11:16:42,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:16:42,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:42,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1591486891, now seen corresponding path program 1 times [2024-10-11 11:16:42,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:42,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29555298] [2024-10-11 11:16:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:16:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:16:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:16:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:16:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:16:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:16:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:16:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:16:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:16:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:16:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:16:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:16:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:16:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:16:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:16:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:16:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:16:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:16:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:42,715 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-11 11:16:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29555298] [2024-10-11 11:16:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29555298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:16:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638482543] [2024-10-11 11:16:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:42,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:16:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:42,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:16:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:16:42,717 INFO L87 Difference]: Start difference. First operand 209 states and 277 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11 11:16:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:42,776 INFO L93 Difference]: Finished difference Result 419 states and 554 transitions. [2024-10-11 11:16:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:16:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 163 [2024-10-11 11:16:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:42,779 INFO L225 Difference]: With dead ends: 419 [2024-10-11 11:16:42,779 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 11:16:42,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:16:42,780 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 63 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:42,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 437 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:16:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 11:16:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 106. [2024-10-11 11:16:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:16:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-10-11 11:16:42,810 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 163 [2024-10-11 11:16:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:42,811 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-10-11 11:16:42,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11 11:16:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-10-11 11:16:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:16:42,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:42,813 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, 1, 1, 1] [2024-10-11 11:16:42,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:16:42,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:42,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash -551479315, now seen corresponding path program 1 times [2024-10-11 11:16:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255978660] [2024-10-11 11:16:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:16:42,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419286673] [2024-10-11 11:16:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:42,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:42,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:42,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:16:42,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 11:16:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:43,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 11:16:43,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:43,425 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-11 11:16:43,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:16:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255978660] [2024-10-11 11:16:43,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:16:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419286673] [2024-10-11 11:16:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419286673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:43,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:43,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:16:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492202065] [2024-10-11 11:16:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:43,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:16:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:43,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:16:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:16:43,428 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-11 11:16:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:43,629 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2024-10-11 11:16:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:16:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 164 [2024-10-11 11:16:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:43,632 INFO L225 Difference]: With dead ends: 319 [2024-10-11 11:16:43,632 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 11:16:43,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:16:43,633 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 102 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:43,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 459 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:16:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 11:16:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2024-10-11 11:16:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 119 states have (on average 1.1764705882352942) internal successors, (140), 119 states have internal predecessors, (140), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:16:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 236 transitions. [2024-10-11 11:16:43,672 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 236 transitions. Word has length 164 [2024-10-11 11:16:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:43,672 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 236 transitions. [2024-10-11 11:16:43,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-11 11:16:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2024-10-11 11:16:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 11:16:43,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:43,674 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, 1, 1, 1] [2024-10-11 11:16:43,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 11:16:43,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 11:16:43,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:43,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash -332624597, now seen corresponding path program 1 times [2024-10-11 11:16:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420383609] [2024-10-11 11:16:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:16:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432555234] [2024-10-11 11:16:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:43,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:43,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:16:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 11:16:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:16:44,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:16:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:16:44,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:16:44,329 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:16:44,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:16:44,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 11:16:44,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:44,535 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:16:44,621 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:16:44,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:16:44 BoogieIcfgContainer [2024-10-11 11:16:44,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:16:44,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:16:44,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:16:44,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:16:44,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:31" (3/4) ... [2024-10-11 11:16:44,631 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:16:44,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:16:44,633 INFO L158 Benchmark]: Toolchain (without parser) took 13905.50ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 93.2MB in the beginning and 202.8MB in the end (delta: -109.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,633 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:16:44,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.38ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 74.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.56ms. Allocated memory is still 161.5MB. Free memory was 74.5MB in the beginning and 69.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,633 INFO L158 Benchmark]: Boogie Preprocessor took 105.58ms. Allocated memory is still 161.5MB. Free memory was 69.1MB in the beginning and 130.1MB in the end (delta: -61.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,633 INFO L158 Benchmark]: RCFGBuilder took 615.09ms. Allocated memory is still 161.5MB. Free memory was 130.1MB in the beginning and 93.1MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,634 INFO L158 Benchmark]: TraceAbstraction took 12798.72ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 92.3MB in the beginning and 203.8MB in the end (delta: -111.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-10-11 11:16:44,634 INFO L158 Benchmark]: Witness Printer took 8.36ms. Allocated memory is still 308.3MB. Free memory was 203.8MB in the beginning and 202.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:16:44,635 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 113.2MB. Free memory was 74.6MB in the beginning and 74.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.38ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 74.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.56ms. Allocated memory is still 161.5MB. Free memory was 74.5MB in the beginning and 69.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.58ms. Allocated memory is still 161.5MB. Free memory was 69.1MB in the beginning and 130.1MB in the end (delta: -61.0MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * RCFGBuilder took 615.09ms. Allocated memory is still 161.5MB. Free memory was 130.1MB in the beginning and 93.1MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12798.72ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 92.3MB in the beginning and 203.8MB in the end (delta: -111.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 8.36ms. Allocated memory is still 308.3MB. Free memory was 203.8MB in the beginning and 202.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of shiftLeft at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned short int var_1_4 = 8; [L24] unsigned short int var_1_5 = 5; [L25] unsigned long int var_1_6 = 256; [L26] float var_1_7 = 9999999999999.2; [L27] float var_1_8 = 499.5; [L28] float var_1_9 = 64.4; [L29] float var_1_10 = 0.5; [L30] float var_1_11 = 5.8; [L31] float var_1_12 = 16.75; [L32] float var_1_13 = 99.5; [L33] signed short int var_1_15 = -10; [L34] unsigned char var_1_17 = 0; [L35] unsigned long int var_1_19 = 2743323310; [L36] unsigned long int var_1_20 = 4162860161; [L37] unsigned char var_1_21 = 0; [L38] double var_1_22 = 99.7; [L39] unsigned long int var_1_23 = 8; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned char var_1_27 = 32; [L44] unsigned char var_1_28 = 200; [L45] float var_1_29 = 16.1; [L46] float var_1_30 = 7.9; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 1; [L49] unsigned char var_1_33 = 8; [L50] signed short int last_1_var_1_15 = -10; [L51] double last_1_var_1_22 = 99.7; [L52] unsigned long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 1; [L54] unsigned char last_1_var_1_27 = 32; [L55] unsigned char last_1_var_1_31 = 0; [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_27 = var_1_27 [L193] last_1_var_1_31 = var_1_31 [L203] RET updateLastVariables() [L204] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L148] RET assume_abort_if_not(var_1_4 >= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] CALL assume_abort_if_not(var_1_4 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] RET assume_abort_if_not(var_1_4 <= 17) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] CALL assume_abort_if_not(var_1_5 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] RET assume_abort_if_not(var_1_5 <= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L153] var_1_8 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L154] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L155] var_1_9 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L156] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L157] var_1_10 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L158] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L159] var_1_11 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L160] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L161] var_1_12 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L162] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L163] var_1_13 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L164] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] RET assume_abort_if_not(var_1_19 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L168] var_1_20 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L169] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L174] var_1_25 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_25 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L175] RET assume_abort_if_not(var_1_25 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L178] RET assume_abort_if_not(var_1_26 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L181] RET assume_abort_if_not(var_1_28 >= 190) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L183] var_1_32 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L184] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L204] RET updateVariables() [L205] CALL step() [L59] COND TRUE (var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24)))) [L60] var_1_6 = 200u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L62] COND FALSE !(\read(last_1_var_1_31)) [L73] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L75] COND FALSE !(\read(var_1_17)) [L78] var_1_31 = (! 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] unsigned long int stepLocal_0 = (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5); [L81] COND FALSE !(stepLocal_0 <= -128) [L84] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L86] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_4=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L87] COND TRUE stepLocal_4 || (last_1_var_1_22 <= var_1_12) [L88] var_1_22 = ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L92] signed long int stepLocal_6 = (((var_1_25) > (256)) ? (var_1_25) : (256)); VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_6=256, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L93] COND TRUE var_1_5 <= stepLocal_6 [L94] var_1_27 = ((var_1_28 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L98] var_1_29 = (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L99] COND TRUE var_1_19 != 25u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L100] COND TRUE ! var_1_21 [L101] var_1_30 = var_1_8 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L106] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L111] signed long int stepLocal_5 = var_1_33 % var_1_4; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_5=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L112] COND FALSE !(stepLocal_5 > var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L115] unsigned long int stepLocal_3 = var_1_6; [L116] signed long int stepLocal_2 = 128; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, stepLocal_3=200, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_1 > stepLocal_3) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L120] COND TRUE var_1_33 != stepLocal_2 [L121] var_1_15 = (var_1_5 - 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L126] COND FALSE !(((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L137] signed long int stepLocal_1 = var_1_33 + var_1_5; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_1=16, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L138] COND TRUE stepLocal_1 > var_1_24 [L139] var_1_7 = (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L205] RET step() [L206] CALL, EXPR property() [L196] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L196-L197] return (((((((((((((((last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5)) <= -128) ? (var_1_1 == ((unsigned char) (var_1_5 + var_1_4))) : (var_1_1 == ((unsigned char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (((var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24))))) ? (var_1_6 == ((unsigned long int) 200u)) : 1)) && (((var_1_33 + var_1_5) > var_1_24) ? (var_1_7 == ((float) (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))))) : ((! var_1_31) ? (var_1_7 == ((float) ((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13))))) : 1))) && ((var_1_1 > var_1_6) ? (var_1_15 == ((signed short int) last_1_var_1_15)) : ((var_1_33 != 128) ? (var_1_15 == ((signed short int) (var_1_5 - 1))) : (var_1_15 == ((signed short int) var_1_27))))) && (last_1_var_1_31 ? (last_1_var_1_31 ? (((((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))) - ((((10u) > (var_1_5)) ? (10u) : (var_1_5)))) != var_1_4) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0))) : (var_1_17 == ((unsigned char) var_1_21))) : (var_1_17 == ((unsigned char) var_1_21)))) && ((var_1_17 || (last_1_var_1_22 <= var_1_12)) ? (var_1_22 == ((double) ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))))) : (var_1_22 == ((double) (var_1_8 - var_1_9))))) && ((((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) ? (((5 * var_1_27) <= var_1_24) ? ((var_1_5 >= var_1_1) ? (var_1_23 == ((unsigned long int) var_1_24)) : (var_1_23 == ((unsigned long int) var_1_5))) : (var_1_23 == ((unsigned long int) var_1_4))) : 1)) && (((var_1_33 % var_1_4) > var_1_5) ? (var_1_24 == ((unsigned char) (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))) - var_1_4))) : 1)) && ((var_1_5 <= ((((var_1_25) > (256)) ? (var_1_25) : (256)))) ? (var_1_27 == ((unsigned char) ((var_1_28 - var_1_4) - var_1_5))) : (var_1_27 == ((unsigned char) (((((var_1_25) > (var_1_28)) ? (var_1_25) : (var_1_28))) - var_1_5))))) && (var_1_29 == ((float) (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13))))))) && ((var_1_19 != 25u) ? ((! var_1_21) ? (var_1_30 == ((float) var_1_8)) : 1) : (var_1_30 == ((float) (var_1_10 - var_1_9))))) && (var_1_17 ? (var_1_31 == ((unsigned char) (! var_1_32))) : (var_1_31 == ((unsigned char) (! 1))))) && (var_1_31 ? (((var_1_6 / var_1_25) <= var_1_4) ? (var_1_33 == ((unsigned char) var_1_5)) : 1) : 1) ; [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1029 mSDsluCounter, 2706 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1836 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2181 IncrementalHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 870 mSDtfsCounter, 2181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1544 GetRequests, 1433 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=5, InterpolantAutomatonStates: 95, 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, 7 MinimizatonAttempts, 310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2120 NumberOfCodeBlocks, 2120 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2103 ConstructedInterpolants, 0 QuantifiedInterpolants, 11281 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1589 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 13644/14352 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-11 11:16:44,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:16:46,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:16:46,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:16:46,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:16:46,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:16:46,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:16:46,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:16:46,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:16:46,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:16:46,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:16:46,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:16:46,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:16:46,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:16:46,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:16:46,632 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:16:46,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:16:46,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:16:46,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:16:46,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:16:46,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:16:46,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:16:46,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:16:46,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:16:46,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:16:46,636 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:16:46,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:16:46,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:16:46,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:16:46,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:16:46,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:16:46,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:16:46,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:16:46,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:16:46,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:16:46,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:46,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:16:46,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:16:46,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:16:46,639 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:16:46,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:16:46,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:16:46,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:16:46,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:16:46,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:16:46,640 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:16:46,640 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-clean/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-clean/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 -> dfd4199778f3470f18ddded1b4acee60166184917bf25c1bba255dc5dd2abf98 [2024-10-11 11:16:46,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:16:46,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:16:46,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:16:46,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:16:46,928 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:16:46,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:48,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:16:48,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:16:48,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:48,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9c6e2da3/78075a5b9f844ff99b2e34f4fd5b51b2/FLAG5360f6524 [2024-10-11 11:16:48,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b9c6e2da3/78075a5b9f844ff99b2e34f4fd5b51b2 [2024-10-11 11:16:48,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:16:48,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:16:48,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:48,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:16:48,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:16:48,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:48" (1/1) ... [2024-10-11 11:16:48,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ff012f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:48, skipping insertion in model container [2024-10-11 11:16:48,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:48" (1/1) ... [2024-10-11 11:16:48,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:16:48,957 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-10-11 11:16:49,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:49,049 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:16:49,060 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_loopvsstraightlinecode_100-while_file-39.i[916,929] [2024-10-11 11:16:49,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:49,124 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:16:49,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49 WrapperNode [2024-10-11 11:16:49,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:49,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:49,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:16:49,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:16:49,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,179 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-11 11:16:49,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:49,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:16:49,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:16:49,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:16:49,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,223 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-11 11:16:49,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:16:49,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:16:49,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:16:49,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:16:49,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (1/1) ... [2024-10-11 11:16:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:49,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:49,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:16:49,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:16:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:16:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:16:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:16:49,338 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:16:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:16:49,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:16:49,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:16:49,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:16:54,732 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:16:54,732 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:16:54,779 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:16:54,780 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:16:54,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:54 BoogieIcfgContainer [2024-10-11 11:16:54,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:16:54,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:16:54,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:16:54,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:16:54,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:16:48" (1/3) ... [2024-10-11 11:16:54,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40924b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:54, skipping insertion in model container [2024-10-11 11:16:54,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:49" (2/3) ... [2024-10-11 11:16:54,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40924b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:54, skipping insertion in model container [2024-10-11 11:16:54,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:54" (3/3) ... [2024-10-11 11:16:54,789 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-39.i [2024-10-11 11:16:54,802 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:16:54,803 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:16:54,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:16:54,866 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;@386c3952, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:16:54,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:16:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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-11 11:16:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 11:16:54,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:54,887 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] [2024-10-11 11:16:54,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 199933563, now seen corresponding path program 1 times [2024-10-11 11:16:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:16:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945293929] [2024-10-11 11:16:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:54,903 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-11 11:16:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:16:54,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 11:16:54,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:16:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:55,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:16:55,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-10-11 11:16:55,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:16:55,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:16:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945293929] [2024-10-11 11:16:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945293929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:16:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631798700] [2024-10-11 11:16:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:55,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:16:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:16:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:16:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:16:55,429 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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.0) internal successors, (46), 2 states have internal predecessors, (46), 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-11 11:16:58,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:16:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:58,232 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-10-11 11:16:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:16:58,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (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 159 [2024-10-11 11:16:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:58,271 INFO L225 Difference]: With dead ends: 155 [2024-10-11 11:16:58,271 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 11:16:58,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-11 11:16:58,275 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:58,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 11:16:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 11:16:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 11:16:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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-11 11:16:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-10-11 11:16:58,314 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 159 [2024-10-11 11:16:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:58,316 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-10-11 11:16:58,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (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-11 11:16:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-10-11 11:16:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 11:16:58,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:58,329 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] [2024-10-11 11:16:58,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:16:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 11:16:58,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:58,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2091081159, now seen corresponding path program 1 times [2024-10-11 11:16:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:16:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823531318] [2024-10-11 11:16:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:58,532 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-11 11:16:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:16:58,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 11:16:58,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:16:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:58,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 11:16:58,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-11 11:16:59,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:17:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:17:00,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:00,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823531318] [2024-10-11 11:17:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823531318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:17:00,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:17:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 11:17:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757799437] [2024-10-11 11:17:00,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:17:00,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:17:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:00,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:17:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:17:00,053 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:17:04,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:04,229 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2024-10-11 11:17:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:17:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 159 [2024-10-11 11:17:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:04,271 INFO L225 Difference]: With dead ends: 161 [2024-10-11 11:17:04,274 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 11:17:04,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:17:04,276 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 251 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:04,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 205 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 11:17:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 11:17:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-11 11:17:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:17:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2024-10-11 11:17:04,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 159 [2024-10-11 11:17:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2024-10-11 11:17:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:17:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2024-10-11 11:17:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 11:17:04,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:04,316 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] [2024-10-11 11:17:04,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:04,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 11:17:04,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:04,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1273432709, now seen corresponding path program 1 times [2024-10-11 11:17:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140044139] [2024-10-11 11:17:04,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:04,518 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-11 11:17:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:04,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 11:17:04,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:04,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:17:04,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-11 11:17:05,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:17:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 11:17:06,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140044139] [2024-10-11 11:17:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140044139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:17:06,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:17:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 11:17:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224044184] [2024-10-11 11:17:06,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:17:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:17:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:17:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:17:06,002 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 11:17:10,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:13,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:13,442 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2024-10-11 11:17:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:17:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 159 [2024-10-11 11:17:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:13,490 INFO L225 Difference]: With dead ends: 169 [2024-10-11 11:17:13,490 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 11:17:13,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:17:13,492 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:13,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 209 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2024-10-11 11:17:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 11:17:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-10-11 11:17:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:17:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-10-11 11:17:13,508 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 159 [2024-10-11 11:17:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:13,509 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-10-11 11:17:13,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 11:17:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-10-11 11:17:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 11:17:13,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:13,511 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-11 11:17:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:17:13,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 11:17:13,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2088967664, now seen corresponding path program 1 times [2024-10-11 11:17:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005740380] [2024-10-11 11:17:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:13,713 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-11 11:17:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:13,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 11:17:13,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:17:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:14,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 11:17:14,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-10-11 11:17:16,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:17:17,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005740380] [2024-10-11 11:17:17,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005740380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:17:17,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [153802900] [2024-10-11 11:17:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:17:17,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:17:17,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:17:17,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 11:17:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:18,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:17:18,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-10-11 11:17:20,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:17:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [153802900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:17:21,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:17:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2024-10-11 11:17:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780229869] [2024-10-11 11:17:21,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:17:21,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:17:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:17:21,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:17:21,829 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 11:17:28,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:32,407 INFO L93 Difference]: Finished difference Result 320 states and 443 transitions. [2024-10-11 11:17:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 11:17:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 160 [2024-10-11 11:17:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:32,412 INFO L225 Difference]: With dead ends: 320 [2024-10-11 11:17:32,412 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 11:17:32,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=361, Invalid=1361, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 11:17:32,413 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 267 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:32,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 562 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-10-11 11:17:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 11:17:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 187. [2024-10-11 11:17:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.265625) internal successors, (162), 128 states have internal predecessors, (162), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:17:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 258 transitions. [2024-10-11 11:17:32,435 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 258 transitions. Word has length 160 [2024-10-11 11:17:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:32,435 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 258 transitions. [2024-10-11 11:17:32,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 11:17:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 258 transitions. [2024-10-11 11:17:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 11:17:32,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:32,437 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-11 11:17:32,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-11 11:17:32,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 11:17:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-clean/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-11 11:17:32,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 283529330, now seen corresponding path program 1 times [2024-10-11 11:17:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214283207] [2024-10-11 11:17:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:32,845 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-11 11:17:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:32,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 11:17:32,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 11:17:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:33,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:17:33,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:17:33,900 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-11 11:17:33,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:17:33,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:17:33,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214283207] [2024-10-11 11:17:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214283207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:17:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:17:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:17:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055530126] [2024-10-11 11:17:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:17:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:17:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:17:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:17:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:17:33,905 INFO L87 Difference]: Start difference. First operand 187 states and 258 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-11 11:17:38,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:39,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:17:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:17:41,044 INFO L93 Difference]: Finished difference Result 375 states and 516 transitions. [2024-10-11 11:17:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:17:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-11 11:17:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:17:41,047 INFO L225 Difference]: With dead ends: 375 [2024-10-11 11:17:41,047 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 11:17:41,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:17:41,050 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 31 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:17:41,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 409 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-10-11 11:17:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 11:17:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-10-11 11:17:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.2578125) internal successors, (161), 128 states have internal predecessors, (161), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:17:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 257 transitions. [2024-10-11 11:17:41,078 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 257 transitions. Word has length 160 [2024-10-11 11:17:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:17:41,079 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 257 transitions. [2024-10-11 11:17:41,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-11 11:17:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 257 transitions. [2024-10-11 11:17:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:17:41,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:17:41,080 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-11 11:17:41,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 11:17:41,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 11:17:41,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:17:41,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:17:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1108728641, now seen corresponding path program 1 times [2024-10-11 11:17:41,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:17:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411228344] [2024-10-11 11:17:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:17:41,282 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-11 11:17:41,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:17:41,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 11:17:41,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-11 11:17:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:17:41,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 11:17:41,735 INFO L278 TraceCheckSpWp]: Computing forward predicates...