./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:01:25,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:01:25,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:01:25,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:01:25,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:01:25,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:01:25,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:01:25,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:01:25,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:01:25,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:01:25,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:01:25,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:01:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:01:25,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:01:25,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:01:25,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:01:25,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:01:25,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:01:25,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:01:25,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:01:25,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:01:25,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:01:25,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:01:25,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:01:25,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:01:25,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:01:25,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:01:25,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:01:25,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:01:25,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:01:25,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:01:25,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:01:25,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:01:25,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:01:25,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:01:25,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:01:25,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:01:25,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:01:25,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:01:25,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:01:25,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:01:25,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:01:25,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2024-11-10 04:01:25,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:01:25,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:01:25,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:01:25,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:01:25,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:01:25,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:27,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:01:27,389 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:01:27,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:27,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f39c6cc/a1e43911408a4309a196cb2279e902aa/FLAG66cd27349 [2024-11-10 04:01:27,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f39c6cc/a1e43911408a4309a196cb2279e902aa [2024-11-10 04:01:27,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:01:27,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:01:27,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:01:27,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:01:27,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:01:27,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:27" (1/1) ... [2024-11-10 04:01:27,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:27, skipping insertion in model container [2024-11-10 04:01:27,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:27" (1/1) ... [2024-11-10 04:01:27,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:01:27,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-10 04:01:28,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:28,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:01:28,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-10 04:01:28,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:28,099 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:01:28,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28 WrapperNode [2024-11-10 04:01:28,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:01:28,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:28,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:01:28,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:01:28,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,160 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-10 04:01:28,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:28,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:01:28,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:01:28,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:01:28,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,199 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:01:28,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:01:28,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:01:28,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:01:28,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:01:28,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (1/1) ... [2024-11-10 04:01:28,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:01:28,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:01:28,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:01:28,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:01:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:01:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:01:28,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:01:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:01:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:01:28,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:01:28,370 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:01:28,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:01:28,637 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise21#1; [2024-11-10 04:01:28,673 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 04:01:28,676 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:01:28,696 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:01:28,696 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:01:28,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:28 BoogieIcfgContainer [2024-11-10 04:01:28,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:01:28,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:01:28,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:01:28,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:01:28,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:01:27" (1/3) ... [2024-11-10 04:01:28,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42584d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:28, skipping insertion in model container [2024-11-10 04:01:28,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:28" (2/3) ... [2024-11-10 04:01:28,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42584d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:28, skipping insertion in model container [2024-11-10 04:01:28,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:28" (3/3) ... [2024-11-10 04:01:28,703 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:28,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:01:28,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:01:28,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:01:28,767 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;@261c0fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:01:28,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:01:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 56 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 04:01:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:01:28,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:28,782 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:28,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:28,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash -321441382, now seen corresponding path program 1 times [2024-11-10 04:01:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694866505] [2024-11-10 04:01:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:01:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:01:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:01:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:01:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:01:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:01:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:01:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:01:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:01:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:01:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:01:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:01:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:01:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:01:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:01:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:01:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:01:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:01:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:01:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:01:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:01:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 04:01:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:01:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 04:01:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:01:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:01:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:01:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:01:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694866505] [2024-11-10 04:01:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694866505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:01:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310136879] [2024-11-10 04:01:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:29,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:01:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:01:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:01:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:01:29,172 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 56 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 04:01:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:29,231 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2024-11-10 04:01:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:01:29,233 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2024-11-10 04:01:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:29,238 INFO L225 Difference]: With dead ends: 162 [2024-11-10 04:01:29,239 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 04:01:29,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:01:29,244 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:29,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:01:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 04:01:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 04:01:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 04:01:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-11-10 04:01:29,282 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 177 [2024-11-10 04:01:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:29,283 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-11-10 04:01:29,284 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 04:01:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-11-10 04:01:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:01:29,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:29,288 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:01:29,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:29,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1421741695, now seen corresponding path program 1 times [2024-11-10 04:01:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566714366] [2024-11-10 04:01:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:01:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:01:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:01:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:01:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:01:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:01:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:01:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:01:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:01:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:01:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:01:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:01:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:01:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:01:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:01:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:01:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:01:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:01:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:01:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:01:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:01:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 04:01:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:01:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 04:01:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:01:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:01:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:01:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:29,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:01:29,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566714366] [2024-11-10 04:01:29,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566714366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:29,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:29,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:01:29,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553291622] [2024-11-10 04:01:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:01:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:01:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:01:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:01:29,595 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:29,656 INFO L93 Difference]: Finished difference Result 193 states and 281 transitions. [2024-11-10 04:01:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:01:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 04:01:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:29,661 INFO L225 Difference]: With dead ends: 193 [2024-11-10 04:01:29,661 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 04:01:29,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:01:29,666 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 41 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:29,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 256 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:01:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 04:01:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-10 04:01:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:01:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-11-10 04:01:29,691 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 177 [2024-11-10 04:01:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:29,693 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-11-10 04:01:29,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-11-10 04:01:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:01:29,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:29,696 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:29,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:01:29,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 911207518, now seen corresponding path program 1 times [2024-11-10 04:01:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367047744] [2024-11-10 04:01:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:01:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:01:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:01:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:01:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:01:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:01:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:01:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:01:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:01:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:01:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:01:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:01:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:01:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:01:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:01:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:01:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:01:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:01:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:01:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:01:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:01:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 04:01:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:01:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 04:01:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:01:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:01:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:01:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:01:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367047744] [2024-11-10 04:01:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367047744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 04:01:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347809515] [2024-11-10 04:01:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:30,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 04:01:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:01:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 04:01:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:01:30,395 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:30,786 INFO L93 Difference]: Finished difference Result 320 states and 466 transitions. [2024-11-10 04:01:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 04:01:30,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 04:01:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:30,790 INFO L225 Difference]: With dead ends: 320 [2024-11-10 04:01:30,790 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 04:01:30,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:01:30,792 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 86 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:30,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 414 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:01:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 04:01:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 166. [2024-11-10 04:01:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 103 states have internal predecessors, (124), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:01:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 244 transitions. [2024-11-10 04:01:30,831 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 244 transitions. Word has length 177 [2024-11-10 04:01:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:30,832 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 244 transitions. [2024-11-10 04:01:30,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 244 transitions. [2024-11-10 04:01:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 04:01:30,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:30,838 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:01:30,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 865260968, now seen corresponding path program 1 times [2024-11-10 04:01:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023630891] [2024-11-10 04:01:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:01:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:01:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:01:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:01:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:01:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:01:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:01:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:01:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:01:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:01:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:01:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:01:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:01:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:01:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:01:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:01:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:01:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 04:01:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:01:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:01:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 04:01:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:01:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 04:01:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:01:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:01:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:01:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:01:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023630891] [2024-11-10 04:01:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023630891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:01:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285240669] [2024-11-10 04:01:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:31,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:01:31,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:01:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:01:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:01:31,049 INFO L87 Difference]: Start difference. First operand 166 states and 244 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:31,218 INFO L93 Difference]: Finished difference Result 319 states and 462 transitions. [2024-11-10 04:01:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:01:31,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-10 04:01:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:31,221 INFO L225 Difference]: With dead ends: 319 [2024-11-10 04:01:31,221 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 04:01:31,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 04:01:31,223 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 128 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:31,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 186 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:01:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 04:01:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2024-11-10 04:01:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 108 states have internal predecessors, (130), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 04:01:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-11-10 04:01:31,257 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 178 [2024-11-10 04:01:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:31,257 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-11-10 04:01:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-11-10 04:01:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 04:01:31,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:31,259 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:31,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:01:31,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 359702343, now seen corresponding path program 1 times [2024-11-10 04:01:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:01:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606133990] [2024-11-10 04:01:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:01:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:01:31,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064627708] [2024-11-10 04:01:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:31,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:01:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:01:31,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:01:31,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:01:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:01:31,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:01:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:01:31,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:01:31,650 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:01:31,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:01:31,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:01:31,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:01:31,856 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 04:01:31,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:01:31,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:01:31 BoogieIcfgContainer [2024-11-10 04:01:31,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:01:31,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:01:31,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:01:31,967 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:01:31,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:28" (3/4) ... [2024-11-10 04:01:31,970 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:01:31,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:01:31,971 INFO L158 Benchmark]: Toolchain (without parser) took 4201.12ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 94.4MB in the beginning and 117.1MB in the end (delta: -22.7MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,971 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:01:31,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.59ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.1MB in the end (delta: -41.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.89ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,973 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 126.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,975 INFO L158 Benchmark]: IcfgBuilder took 474.04ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 101.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,975 INFO L158 Benchmark]: TraceAbstraction took 3268.94ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 101.5MB in the beginning and 117.1MB in the end (delta: -15.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-10 04:01:31,975 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 232.8MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:01:31,976 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.15ms. Allocated memory is still 167.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.59ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.1MB in the end (delta: -41.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.89ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 126.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 474.04ms. Allocated memory is still 167.8MB. Free memory was 126.7MB in the beginning and 101.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3268.94ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 101.5MB in the beginning and 117.1MB in the end (delta: -15.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 232.8MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] double var_1_26 = 99999999999999.5; [L44] unsigned char var_1_27 = 4; [L45] unsigned char var_1_28 = 64; [L46] signed long int var_1_29 = 128; [L47] signed char var_1_30 = -5; [L48] signed char var_1_31 = -100; [L49] unsigned long int var_1_32 = 1; [L50] unsigned long int var_1_33 = 8; [L51] unsigned char var_1_34 = 5; [L52] double var_1_35 = 10000.225; [L53] signed short int last_1_var_1_21 = -64; [L54] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_21 = var_1_21 [L155] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L109] var_1_4 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L112] var_1_5 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L115] var_1_6 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L118] var_1_9 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L119] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L127] var_1_13 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L130] var_1_14 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L133] var_1_17 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] var_1_26 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L143] var_1_28 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L146] var_1_31 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] var_1_33 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=-255, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L166] RET updateVariables() [L167] CALL step() [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = var_1_28 [L61] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND TRUE ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) < var_1_29 [L63] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] var_1_34 = var_1_28 [L66] var_1_35 = var_1_26 [L67] signed long int stepLocal_1 = ~ last_1_var_1_21; [L68] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L70] COND TRUE stepLocal_0 || var_1_6 [L71] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L81] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_4 > stepLocal_3) [L85] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L87] COND TRUE ((- var_1_11) < 8) || var_1_9 [L88] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L90] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND TRUE var_1_18 <= var_1_20 [L92] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] COND TRUE var_1_10 > stepLocal_2 [L105] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158-L159] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=-255, var_1_28=-255, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-255, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 470 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 88 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 1065 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 2125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5616/5616 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:01:32,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:01:33,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:01:33,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:01:33,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:01:33,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:01:33,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:01:33,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:01:33,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:01:33,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:01:33,929 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:01:33,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:01:33,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:01:33,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:01:33,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:01:33,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:01:33,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:01:33,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:01:33,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:01:33,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:01:33,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:01:33,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:01:33,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:01:33,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:01:33,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:01:33,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:01:33,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:01:33,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:01:33,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:01:33,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:01:33,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:01:33,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:01:33,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:01:33,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:01:33,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:01:33,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:01:33,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:01:33,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:01:33,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:01:33,935 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:01:33,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:01:33,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:01:33,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:01:33,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:01:33,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:01:33,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2024-11-10 04:01:34,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:01:34,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:01:34,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:01:34,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:01:34,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:01:34,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:35,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:01:35,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:01:35,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:35,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe8926d1/5796c6e37b6448599ad66b049b844513/FLAGeb789bdd8 [2024-11-10 04:01:35,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe8926d1/5796c6e37b6448599ad66b049b844513 [2024-11-10 04:01:35,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:01:35,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:01:35,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:01:35,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:01:35,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:01:35,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:35" (1/1) ... [2024-11-10 04:01:35,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7362ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:35, skipping insertion in model container [2024-11-10 04:01:35,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:35" (1/1) ... [2024-11-10 04:01:35,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:01:35,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-10 04:01:35,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:35,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:01:36,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2024-11-10 04:01:36,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:01:36,073 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:01:36,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36 WrapperNode [2024-11-10 04:01:36,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:01:36,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:36,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:01:36,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:01:36,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,123 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-10 04:01:36,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:01:36,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:01:36,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:01:36,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:01:36,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,151 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:01:36,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,166 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:01:36,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:01:36,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:01:36,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:01:36,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (1/1) ... [2024-11-10 04:01:36,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:01:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:01:36,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:01:36,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:01:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:01:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:01:36,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:01:36,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:01:36,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:01:36,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:01:36,342 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:01:36,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:01:40,492 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 04:01:40,492 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:01:40,503 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:01:40,503 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:01:40,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:40 BoogieIcfgContainer [2024-11-10 04:01:40,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:01:40,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:01:40,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:01:40,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:01:40,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:01:35" (1/3) ... [2024-11-10 04:01:40,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eca816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:40, skipping insertion in model container [2024-11-10 04:01:40,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:36" (2/3) ... [2024-11-10 04:01:40,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59eca816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:01:40, skipping insertion in model container [2024-11-10 04:01:40,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:01:40" (3/3) ... [2024-11-10 04:01:40,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2024-11-10 04:01:40,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:01:40,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:01:40,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:01:40,577 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;@1e5e7851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:01:40,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:01:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 04:01:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:01:40,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:40,592 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:40,592 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:40,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1681213454, now seen corresponding path program 1 times [2024-11-10 04:01:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317231015] [2024-11-10 04:01:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:40,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:01:40,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:01:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:40,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:01:40,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2024-11-10 04:01:41,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:01:41,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317231015] [2024-11-10 04:01:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317231015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:01:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507857946] [2024-11-10 04:01:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:01:41,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:01:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:01:41,046 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.32) internal successors, (66), 51 states have internal predecessors, (66), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 04:01:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:41,066 INFO L93 Difference]: Finished difference Result 152 states and 260 transitions. [2024-11-10 04:01:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:01:41,069 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-11-10 04:01:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:41,074 INFO L225 Difference]: With dead ends: 152 [2024-11-10 04:01:41,074 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 04:01:41,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:01:41,079 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:41,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:01:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 04:01:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 04:01:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 04:01:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-11-10 04:01:41,118 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 174 [2024-11-10 04:01:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:41,118 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-11-10 04:01:41,119 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 04:01:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-10 04:01:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:01:41,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:41,122 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:41,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:01:41,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:41,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:41,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1619882707, now seen corresponding path program 1 times [2024-11-10 04:01:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521518064] [2024-11-10 04:01:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:41,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:41,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:01:41,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:01:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:41,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:01:41,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:42,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:01:42,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521518064] [2024-11-10 04:01:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521518064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:01:42,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:01:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:01:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667033873] [2024-11-10 04:01:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:42,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:01:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:42,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:01:42,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:01:42,889 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:44,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:01:46,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:01:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:46,735 INFO L93 Difference]: Finished difference Result 221 states and 329 transitions. [2024-11-10 04:01:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:01:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-10 04:01:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:46,760 INFO L225 Difference]: With dead ends: 221 [2024-11-10 04:01:46,760 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 04:01:46,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:01:46,761 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 66 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:46,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 359 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-10 04:01:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 04:01:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2024-11-10 04:01:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 04:01:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-10 04:01:46,799 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 174 [2024-11-10 04:01:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:46,800 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-10 04:01:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-10 04:01:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:01:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:46,803 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:46,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 04:01:47,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:47,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:47,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1071861779, now seen corresponding path program 1 times [2024-11-10 04:01:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680130392] [2024-11-10 04:01:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:47,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:47,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:01:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:01:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:47,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:01:47,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:01:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 54 proven. 150 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 04:01:48,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:01:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 04:01:48,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:01:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680130392] [2024-11-10 04:01:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680130392] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:01:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:01:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-10 04:01:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711724411] [2024-11-10 04:01:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:01:48,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:01:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:01:48,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:01:48,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:01:48,481 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:50,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:01:52,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:01:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:01:52,230 INFO L93 Difference]: Finished difference Result 221 states and 327 transitions. [2024-11-10 04:01:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:01:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-11-10 04:01:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:01:52,234 INFO L225 Difference]: With dead ends: 221 [2024-11-10 04:01:52,234 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 04:01:52,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:01:52,236 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 27 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:01:52,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 289 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 04:01:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 04:01:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-10 04:01:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 74 states have internal predecessors, (87), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 04:01:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2024-11-10 04:01:52,267 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 175 [2024-11-10 04:01:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:01:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 195 transitions. [2024-11-10 04:01:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 04:01:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions. [2024-11-10 04:01:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:01:52,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:01:52,273 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:01:52,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:01:52,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:52,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:01:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:01:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1200944498, now seen corresponding path program 1 times [2024-11-10 04:01:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:01:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523500395] [2024-11-10 04:01:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:01:52,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:01:52,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:01:52,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:01:52,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:01:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:01:52,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 04:01:52,752 INFO L278 TraceCheckSpWp]: Computing forward predicates...