./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb80fa7d4ae67314d0904101ec6e180cc4624c99101014b83eef6a8504613a00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:29:41,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:29:41,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:29:41,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:29:41,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:29:41,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:29:41,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:29:41,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:29:41,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:29:41,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:29:41,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:29:41,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:29:41,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:29:41,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:29:41,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:29:41,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:29:41,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:29:41,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:29:41,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:29:41,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:29:41,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:29:41,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:29:41,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:29:41,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:29:41,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:29:41,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:29:41,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:29:41,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:29:41,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:29:41,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:29:41,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:29:41,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:29:41,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:41,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:29:41,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:29:41,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:29:41,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:29:41,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb80fa7d4ae67314d0904101ec6e180cc4624c99101014b83eef6a8504613a00 [2024-10-11 08:29:42,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:29:42,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:29:42,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:29:42,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:29:42,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:29:42,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:29:43,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:29:43,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:29:43,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:29:43,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/501e35b9a/ee7e78e4f462489e9f12160461440326/FLAG5139d2fe8 [2024-10-11 08:29:43,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/501e35b9a/ee7e78e4f462489e9f12160461440326 [2024-10-11 08:29:43,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:29:43,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:29:43,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:43,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:29:43,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:29:43,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21745c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43, skipping insertion in model container [2024-10-11 08:29:43,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:29:43,711 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i[915,928] [2024-10-11 08:29:43,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:43,779 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:29:43,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i[915,928] [2024-10-11 08:29:43,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:43,830 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:29:43,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43 WrapperNode [2024-10-11 08:29:43,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:43,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:43,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:29:43,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:29:43,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,872 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-10-11 08:29:43,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:43,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:29:43,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:29:43,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:29:43,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:29:43,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:29:43,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:29:43,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:29:43,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:29:43,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (1/1) ... [2024-10-11 08:29:43,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:43,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:29:43,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:29:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:29:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:29:44,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:29:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:29:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:29:44,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:29:44,090 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:29:44,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:29:44,396 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 08:29:44,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:29:44,423 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:29:44,424 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:29:44,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:44 BoogieIcfgContainer [2024-10-11 08:29:44,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:29:44,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:29:44,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:29:44,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:29:44,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:29:43" (1/3) ... [2024-10-11 08:29:44,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408ddd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:44, skipping insertion in model container [2024-10-11 08:29:44,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:43" (2/3) ... [2024-10-11 08:29:44,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408ddd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:29:44, skipping insertion in model container [2024-10-11 08:29:44,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:44" (3/3) ... [2024-10-11 08:29:44,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:29:44,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:29:44,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:29:44,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:29:44,497 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;@366899ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:29:44,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:29:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 08:29:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 08:29:44,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:44,518 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:44,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:44,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1747937898, now seen corresponding path program 1 times [2024-10-11 08:29:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140838691] [2024-10-11 08:29:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:29:45,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140838691] [2024-10-11 08:29:45,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140838691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:45,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:45,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:29:45,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087865210] [2024-10-11 08:29:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:45,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:29:45,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:45,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:29:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:29:45,083 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 08:29:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:45,129 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2024-10-11 08:29:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:29:45,135 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-10-11 08:29:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:45,142 INFO L225 Difference]: With dead ends: 192 [2024-10-11 08:29:45,142 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 08:29:45,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:29:45,152 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:45,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:29:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 08:29:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 08:29:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 08:29:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-10-11 08:29:45,203 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 218 [2024-10-11 08:29:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:45,203 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-10-11 08:29:45,203 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 08:29:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-10-11 08:29:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 08:29:45,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:45,209 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:29:45,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1936311012, now seen corresponding path program 1 times [2024-10-11 08:29:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325503932] [2024-10-11 08:29:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:29:45,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325503932] [2024-10-11 08:29:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325503932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:29:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938826678] [2024-10-11 08:29:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:29:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:45,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:29:45,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:29:45,560 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:45,613 INFO L93 Difference]: Finished difference Result 221 states and 335 transitions. [2024-10-11 08:29:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:29:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-11 08:29:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:45,619 INFO L225 Difference]: With dead ends: 221 [2024-10-11 08:29:45,619 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 08:29:45,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:29:45,622 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 42 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:45,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 276 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:29:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 08:29:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-10-11 08:29:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.294871794871795) internal successors, (101), 79 states have internal predecessors, (101), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 08:29:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2024-10-11 08:29:45,647 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 218 [2024-10-11 08:29:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:45,648 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2024-10-11 08:29:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2024-10-11 08:29:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 08:29:45,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:45,655 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:45,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:29:45,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:45,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1549309658, now seen corresponding path program 1 times [2024-10-11 08:29:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542686471] [2024-10-11 08:29:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:29:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542686471] [2024-10-11 08:29:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542686471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:29:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438266731] [2024-10-11 08:29:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:29:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:46,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:29:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:29:46,584 INFO L87 Difference]: Start difference. First operand 124 states and 187 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:46,874 INFO L93 Difference]: Finished difference Result 360 states and 541 transitions. [2024-10-11 08:29:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:29:46,875 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-11 08:29:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:46,881 INFO L225 Difference]: With dead ends: 360 [2024-10-11 08:29:46,882 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 08:29:46,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 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-10-11 08:29:46,884 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 93 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:46,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 471 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:29:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 08:29:46,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 196. [2024-10-11 08:29:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 113 states have (on average 1.238938053097345) internal successors, (140), 114 states have internal predecessors, (140), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:29:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 296 transitions. [2024-10-11 08:29:46,931 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 296 transitions. Word has length 218 [2024-10-11 08:29:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:46,932 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 296 transitions. [2024-10-11 08:29:46,932 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 296 transitions. [2024-10-11 08:29:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 08:29:46,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:46,934 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:46,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:29:46,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:46,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:46,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2112086096, now seen corresponding path program 1 times [2024-10-11 08:29:46,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:46,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521472918] [2024-10-11 08:29:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:46,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:29:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521472918] [2024-10-11 08:29:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521472918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:29:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337817519] [2024-10-11 08:29:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:29:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:29:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:29:47,383 INFO L87 Difference]: Start difference. First operand 196 states and 296 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:47,649 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2024-10-11 08:29:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:29:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-11 08:29:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:47,652 INFO L225 Difference]: With dead ends: 360 [2024-10-11 08:29:47,652 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 08:29:47,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:29:47,654 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:47,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 472 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:29:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 08:29:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 197. [2024-10-11 08:29:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 114 states have (on average 1.236842105263158) internal successors, (141), 115 states have internal predecessors, (141), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:29:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 297 transitions. [2024-10-11 08:29:47,694 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 297 transitions. Word has length 219 [2024-10-11 08:29:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 297 transitions. [2024-10-11 08:29:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 297 transitions. [2024-10-11 08:29:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 08:29:47,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:47,698 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:47,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:29:47,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:47,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash 832222418, now seen corresponding path program 1 times [2024-10-11 08:29:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117069543] [2024-10-11 08:29:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:29:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117069543] [2024-10-11 08:29:48,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117069543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:29:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:29:48,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 08:29:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132878909] [2024-10-11 08:29:48,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:29:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:29:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:48,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:29:48,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:29:48,544 INFO L87 Difference]: Start difference. First operand 197 states and 297 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:48,995 INFO L93 Difference]: Finished difference Result 360 states and 539 transitions. [2024-10-11 08:29:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:29:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-11 08:29:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:48,999 INFO L225 Difference]: With dead ends: 360 [2024-10-11 08:29:48,999 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 08:29:49,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:29:49,000 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 125 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:49,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 639 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:29:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 08:29:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2024-10-11 08:29:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 135 states have internal predecessors, (170), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:29:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 326 transitions. [2024-10-11 08:29:49,026 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 326 transitions. Word has length 219 [2024-10-11 08:29:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 326 transitions. [2024-10-11 08:29:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:29:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 326 transitions. [2024-10-11 08:29:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:29:49,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:49,029 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:49,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:29:49,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:49,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:49,030 INFO L85 PathProgramCache]: Analyzing trace with hash 317988129, now seen corresponding path program 1 times [2024-10-11 08:29:49,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:49,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899340414] [2024-10-11 08:29:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:49,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:29:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:29:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:29:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:29:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:29:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:29:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:29:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:29:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:29:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:29:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:29:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:29:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:29:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:29:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:29:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:29:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:29:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:29:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:29:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:29:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:29:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:29:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:29:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:29:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:29:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 08:29:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:29:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 08:29:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:29:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 08:29:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:29:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 08:29:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:29:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:29:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 08:29:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 08:29:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:29:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899340414] [2024-10-11 08:29:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899340414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:29:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738647444] [2024-10-11 08:29:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:49,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:49,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:49,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:29:49,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:29:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:29:49,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 08:29:49,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:29:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1040 proven. 138 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-10-11 08:29:50,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:29:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 60 proven. 141 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-10-11 08:29:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738647444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:29:51,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:29:51,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-11 08:29:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482355920] [2024-10-11 08:29:51,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:29:51,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 08:29:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:29:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 08:29:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-11 08:29:51,755 INFO L87 Difference]: Start difference. First operand 217 states and 326 transitions. Second operand has 27 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 8 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 8 states have call successors, (85) [2024-10-11 08:29:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:29:53,147 INFO L93 Difference]: Finished difference Result 471 states and 672 transitions. [2024-10-11 08:29:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 08:29:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 8 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 8 states have call successors, (85) Word has length 221 [2024-10-11 08:29:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:29:53,153 INFO L225 Difference]: With dead ends: 471 [2024-10-11 08:29:53,153 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 08:29:53,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=726, Invalid=1824, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 08:29:53,156 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 570 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:29:53,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 445 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 08:29:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 08:29:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 251. [2024-10-11 08:29:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 161 states have (on average 1.2111801242236024) internal successors, (195), 162 states have internal predecessors, (195), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:29:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2024-10-11 08:29:53,192 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 221 [2024-10-11 08:29:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:29:53,192 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2024-10-11 08:29:53,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.16) internal successors, (129), 25 states have internal predecessors, (129), 8 states have call successors, (84), 3 states have call predecessors, (84), 6 states have return successors, (85), 7 states have call predecessors, (85), 8 states have call successors, (85) [2024-10-11 08:29:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2024-10-11 08:29:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 08:29:53,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:29:53,194 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:53,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:29:53,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:53,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:29:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:29:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -491358497, now seen corresponding path program 1 times [2024-10-11 08:29:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:29:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135304435] [2024-10-11 08:29:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:29:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:29:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863317772] [2024-10-11 08:29:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:29:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:53,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:29:53,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:29:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:29:53,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:29:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:29:53,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:29:53,780 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:29:53,781 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:29:53,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:29:53,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:29:53,987 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:29:54,088 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:29:54,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:29:54 BoogieIcfgContainer [2024-10-11 08:29:54,090 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:29:54,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:29:54,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:29:54,091 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:29:54,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:29:44" (3/4) ... [2024-10-11 08:29:54,093 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:29:54,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:29:54,095 INFO L158 Benchmark]: Toolchain (without parser) took 10546.92ms. Allocated memory was 182.5MB in the beginning and 408.9MB in the end (delta: 226.5MB). Free memory was 125.4MB in the beginning and 222.5MB in the end (delta: -97.1MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,095 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 146.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:29:54,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.62ms. Allocated memory is still 182.5MB. Free memory was 125.4MB in the beginning and 107.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.65ms. Allocated memory is still 182.5MB. Free memory was 107.8MB in the beginning and 103.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,095 INFO L158 Benchmark]: Boogie Preprocessor took 51.85ms. Allocated memory is still 182.5MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,095 INFO L158 Benchmark]: RCFGBuilder took 499.61ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 69.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,096 INFO L158 Benchmark]: TraceAbstraction took 9664.11ms. Allocated memory was 182.5MB in the beginning and 408.9MB in the end (delta: 226.5MB). Free memory was 68.7MB in the beginning and 222.5MB in the end (delta: -153.8MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2024-10-11 08:29:54,096 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 408.9MB. Free memory is still 222.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:29:54,097 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.14ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 146.0MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.62ms. Allocated memory is still 182.5MB. Free memory was 125.4MB in the beginning and 107.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.65ms. Allocated memory is still 182.5MB. Free memory was 107.8MB in the beginning and 103.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.85ms. Allocated memory is still 182.5MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 499.61ms. Allocated memory is still 182.5MB. Free memory was 99.5MB in the beginning and 69.5MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9664.11ms. Allocated memory was 182.5MB in the beginning and 408.9MB in the end (delta: 226.5MB). Free memory was 68.7MB in the beginning and 222.5MB in the end (delta: -153.8MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 408.9MB. Free memory is still 222.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] signed char var_1_26 = -1; [L44] signed short int var_1_27 = 1; [L45] unsigned char var_1_28 = 32; [L46] unsigned char var_1_29 = 2; [L47] unsigned short int var_1_30 = 8; [L48] signed char var_1_31 = 0; [L49] unsigned char var_1_32 = 0; [L50] unsigned char var_1_33 = 0; [L51] signed char var_1_34 = -5; [L52] signed char var_1_35 = 32; [L53] signed char var_1_36 = 100; [L54] float var_1_37 = 3.6; [L55] float var_1_38 = 10000.25; [L56] unsigned long int last_1_var_1_1 = 64; [L57] unsigned char last_1_var_1_11 = 50; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_11 = var_1_11 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L125] var_1_4 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L128] var_1_5 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L131] var_1_7 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L132] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L133] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L134] var_1_9 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L135] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L137] var_1_10 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L139] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L140] var_1_12 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L143] var_1_13 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] var_1_17 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] var_1_19 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_20 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] var_1_21 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] var_1_22 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_23 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=-1, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] var_1_26 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_28=32, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_28 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_28 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not(var_1_28 <= 255) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_29=2, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] var_1_29 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_29 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not(var_1_29 <= 255) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_33 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_33 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] RET assume_abort_if_not(var_1_33 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=32, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] var_1_35 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_35 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L174] RET assume_abort_if_not(var_1_35 >= -126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=100, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] var_1_36 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_38=40001/4, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L179] var_1_38 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L195] RET updateVariables() [L196] CALL step() [L61] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=1, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] COND TRUE (var_1_26 > (var_1_25 ^ -64)) || (var_1_28 > var_1_29) [L63] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=8, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L65] var_1_30 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) [L66] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L67] COND TRUE ((((100) < 0 ) ? -(100) : (100))) <= ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))) [L68] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=-5, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L70] COND FALSE !(\read(var_1_33)) [L75] var_1_34 = ((((var_1_36) < (var_1_35)) ? (var_1_36) : (var_1_35))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=18/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L77] var_1_37 = var_1_38 [L78] signed long int stepLocal_1 = last_1_var_1_11; [L79] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L80] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L81] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L85] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L86] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L86] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L87] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L98] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L100] COND FALSE !(! (var_1_11 >= var_1_11)) [L107] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L109] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] COND FALSE !(\read(var_1_10)) [L117] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187-L188] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=101, var_1_29=100, var_1_30=101, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=2, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 7, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 2446 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1649 mSDsCounter, 694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1202 IncrementalHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 694 mSolverCounterUnsat, 797 mSDtfsCounter, 1202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 192 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1976 NumberOfCodeBlocks, 1976 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 8069 SizeOfPredicates, 4 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 18695/19040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:29:54,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb80fa7d4ae67314d0904101ec6e180cc4624c99101014b83eef6a8504613a00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:29:55,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:29:55,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:29:56,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:29:56,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:29:56,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:29:56,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:29:56,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:29:56,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:29:56,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:29:56,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:29:56,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:29:56,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:29:56,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:29:56,038 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:29:56,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:29:56,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:29:56,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:29:56,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:29:56,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:29:56,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:29:56,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:29:56,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:29:56,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:29:56,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:29:56,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:29:56,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:29:56,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:29:56,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:29:56,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:56,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:29:56,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:29:56,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:29:56,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:29:56,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:29:56,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:29:56,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:29:56,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:29:56,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:29:56,047 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:29:56,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb80fa7d4ae67314d0904101ec6e180cc4624c99101014b83eef6a8504613a00 [2024-10-11 08:29:56,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:29:56,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:29:56,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:29:56,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:29:56,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:29:56,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:29:57,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:29:57,725 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:29:57,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:29:57,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11c2b5933/ae47c156010a4f32bc7b3d48c7bc97ab/FLAGb20e76d92 [2024-10-11 08:29:57,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11c2b5933/ae47c156010a4f32bc7b3d48c7bc97ab [2024-10-11 08:29:57,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:29:57,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:29:57,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:57,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:29:57,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:29:57,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:57" (1/1) ... [2024-10-11 08:29:57,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5a1d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:57, skipping insertion in model container [2024-10-11 08:29:57,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:29:57" (1/1) ... [2024-10-11 08:29:57,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:29:57,923 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i[915,928] [2024-10-11 08:29:57,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:58,012 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:29:58,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-74.i[915,928] [2024-10-11 08:29:58,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:29:58,071 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:29:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58 WrapperNode [2024-10-11 08:29:58,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:29:58,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:58,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:29:58,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:29:58,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,120 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-11 08:29:58,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:29:58,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:29:58,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:29:58,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:29:58,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:29:58,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:29:58,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:29:58,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:29:58,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:29:58,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (1/1) ... [2024-10-11 08:29:58,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:29:58,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:29:58,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:29:58,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:29:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:29:58,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:29:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:29:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:29:58,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:29:58,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:29:58,319 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:29:58,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:30:01,465 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:30:01,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:30:01,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:30:01,533 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:30:01,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:30:01 BoogieIcfgContainer [2024-10-11 08:30:01,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:30:01,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:30:01,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:30:01,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:30:01,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:29:57" (1/3) ... [2024-10-11 08:30:01,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7931f335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:30:01, skipping insertion in model container [2024-10-11 08:30:01,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:29:58" (2/3) ... [2024-10-11 08:30:01,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7931f335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:30:01, skipping insertion in model container [2024-10-11 08:30:01,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:30:01" (3/3) ... [2024-10-11 08:30:01,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-74.i [2024-10-11 08:30:01,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:30:01,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:30:01,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:30:01,637 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;@2c26a5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:30:01,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:30:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 08:30:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:30:01,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:01,660 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:30:01,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -311275540, now seen corresponding path program 1 times [2024-10-11 08:30:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380555641] [2024-10-11 08:30:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:01,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:01,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:01,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:01,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:30:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:02,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:30:02,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:30:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:30:03,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:30:03,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:30:03,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380555641] [2024-10-11 08:30:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380555641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:30:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:30:03,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:30:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510513661] [2024-10-11 08:30:03,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:30:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:30:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:30:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:30:03,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:30:03,468 INFO L87 Difference]: Start difference. First operand has 88 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:30:05,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:07,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:30:07,715 INFO L93 Difference]: Finished difference Result 257 states and 485 transitions. [2024-10-11 08:30:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:30:07,739 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 214 [2024-10-11 08:30:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:30:07,746 INFO L225 Difference]: With dead ends: 257 [2024-10-11 08:30:07,746 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 08:30:07,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 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-10-11 08:30:07,751 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 72 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:30:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 421 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 08:30:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 08:30:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2024-10-11 08:30:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 08:30:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2024-10-11 08:30:07,819 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 214 [2024-10-11 08:30:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:30:07,822 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2024-10-11 08:30:07,822 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:30:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2024-10-11 08:30:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:30:07,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:07,826 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:30:07,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:30:08,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:08,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:08,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1952418562, now seen corresponding path program 1 times [2024-10-11 08:30:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:08,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206589384] [2024-10-11 08:30:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:08,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:08,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:30:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:08,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:30:08,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:30:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 08:30:09,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:30:09,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:30:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206589384] [2024-10-11 08:30:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206589384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:30:09,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:30:09,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:30:09,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527020128] [2024-10-11 08:30:09,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:30:09,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:30:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:30:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:30:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:30:09,388 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:30:11,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:13,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:30:13,747 INFO L93 Difference]: Finished difference Result 254 states and 394 transitions. [2024-10-11 08:30:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:30:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 215 [2024-10-11 08:30:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:30:13,769 INFO L225 Difference]: With dead ends: 254 [2024-10-11 08:30:13,769 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 08:30:13,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 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-10-11 08:30:13,773 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 70 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:30:13,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 422 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 08:30:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 08:30:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2024-10-11 08:30:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 08:30:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2024-10-11 08:30:13,796 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 215 [2024-10-11 08:30:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:30:13,797 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2024-10-11 08:30:13,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 08:30:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2024-10-11 08:30:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:30:13,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:13,799 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:30:13,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:30:14,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:14,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:14,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1251353984, now seen corresponding path program 1 times [2024-10-11 08:30:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945089694] [2024-10-11 08:30:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:14,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:14,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:14,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:30:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:14,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:30:14,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:30:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 952 proven. 75 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-10-11 08:30:14,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:30:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 27 proven. 75 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 08:30:15,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:30:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945089694] [2024-10-11 08:30:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945089694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:30:15,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:30:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 08:30:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709115108] [2024-10-11 08:30:15,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:30:15,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:30:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:30:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:30:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:30:15,041 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2024-10-11 08:30:17,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:30:17,543 INFO L93 Difference]: Finished difference Result 253 states and 382 transitions. [2024-10-11 08:30:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 08:30:17,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 215 [2024-10-11 08:30:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:30:17,546 INFO L225 Difference]: With dead ends: 253 [2024-10-11 08:30:17,546 INFO L226 Difference]: Without dead ends: 169 [2024-10-11 08:30:17,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:30:17,547 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:30:17,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 08:30:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-11 08:30:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-10-11 08:30:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 86 states have internal predecessors, (101), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 08:30:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 241 transitions. [2024-10-11 08:30:17,579 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 241 transitions. Word has length 215 [2024-10-11 08:30:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:30:17,580 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 241 transitions. [2024-10-11 08:30:17,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2024-10-11 08:30:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 241 transitions. [2024-10-11 08:30:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:30:17,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:17,584 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:30:17,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 08:30:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:17,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1194095682, now seen corresponding path program 1 times [2024-10-11 08:30:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728002008] [2024-10-11 08:30:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:17,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:17,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:30:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:18,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 08:30:18,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:30:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1040 proven. 138 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-10-11 08:30:18,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:30:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 30 proven. 72 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 08:30:19,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:30:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728002008] [2024-10-11 08:30:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728002008] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:30:19,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:30:19,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-11 08:30:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562849493] [2024-10-11 08:30:19,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:30:19,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 08:30:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:30:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 08:30:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 08:30:19,347 INFO L87 Difference]: Start difference. First operand 161 states and 241 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-11 08:30:21,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:30:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:30:22,596 INFO L93 Difference]: Finished difference Result 310 states and 438 transitions. [2024-10-11 08:30:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 08:30:22,597 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 215 [2024-10-11 08:30:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:30:22,599 INFO L225 Difference]: With dead ends: 310 [2024-10-11 08:30:22,599 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 08:30:22,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-11 08:30:22,603 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 158 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:30:22,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 384 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 08:30:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 08:30:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 201. [2024-10-11 08:30:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 113 states have (on average 1.1415929203539823) internal successors, (129), 114 states have internal predecessors, (129), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 08:30:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 285 transitions. [2024-10-11 08:30:22,622 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 285 transitions. Word has length 215 [2024-10-11 08:30:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:30:22,623 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 285 transitions. [2024-10-11 08:30:22,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 16 states have internal predecessors, (85), 4 states have call successors, (59), 3 states have call predecessors, (59), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-11 08:30:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 285 transitions. [2024-10-11 08:30:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:30:22,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:30:22,625 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:30:22,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:30:22,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:22,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:30:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:30:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1194036100, now seen corresponding path program 1 times [2024-10-11 08:30:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:30:22,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255677063] [2024-10-11 08:30:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:30:22,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:30:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:30:22,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:30:22,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:30:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:30:23,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 08:30:23,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:31:03,790 WARN L286 SmtUtils]: Spent 11.81s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)