./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:43:47,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:43:47,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:43:47,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:43:47,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:43:47,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:43:47,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:43:47,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:43:47,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:43:47,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:43:47,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:43:47,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:43:47,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:43:47,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:43:47,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:43:47,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:43:47,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:43:47,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:43:47,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:43:47,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:43:47,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:43:47,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:43:47,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:43:47,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:43:47,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:43:47,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:43:47,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:43:47,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:43:47,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:43:47,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:43:47,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:43:47,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:43:47,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:43:47,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:43:47,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:43:47,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:43:47,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:43:47,970 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2024-11-12 01:43:48,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:43:48,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:43:48,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:43:48,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:43:48,229 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:43:48,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:43:49,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:43:49,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:43:49,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:43:49,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8c21cd0/772d4c8be1c04926b042e5b8eeac6376/FLAG7c1dbc503 [2024-11-12 01:43:49,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8c21cd0/772d4c8be1c04926b042e5b8eeac6376 [2024-11-12 01:43:49,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:43:49,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:43:49,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:43:49,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:43:49,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:43:49,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:49" (1/1) ... [2024-11-12 01:43:49,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8af8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:49, skipping insertion in model container [2024-11-12 01:43:49,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:43:49" (1/1) ... [2024-11-12 01:43:49,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:43:50,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i[913,926] [2024-11-12 01:43:50,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:43:50,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:43:50,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i[913,926] [2024-11-12 01:43:50,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:43:50,174 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:43:50,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50 WrapperNode [2024-11-12 01:43:50,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:43:50,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:43:50,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:43:50,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:43:50,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,224 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-12 01:43:50,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:43:50,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:43:50,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:43:50,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:43:50,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,264 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:43:50,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:43:50,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:43:50,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:43:50,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:43:50,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (1/1) ... [2024-11-12 01:43:50,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:43:50,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:43:50,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:43:50,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:43:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:43:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:43:50,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:43:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:43:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:43:50,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:43:50,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:43:50,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:43:50,674 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 01:43:50,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:43:50,685 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:43:50,685 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:43:50,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:50 BoogieIcfgContainer [2024-11-12 01:43:50,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:43:50,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:43:50,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:43:50,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:43:50,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:43:49" (1/3) ... [2024-11-12 01:43:50,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6b6abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:50, skipping insertion in model container [2024-11-12 01:43:50,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:43:50" (2/3) ... [2024-11-12 01:43:50,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6b6abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:43:50, skipping insertion in model container [2024-11-12 01:43:50,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:50" (3/3) ... [2024-11-12 01:43:50,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:43:50,706 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:43:50,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:43:50,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:43:50,778 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;@1c2de849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:43:50,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:43:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:43:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:43:50,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:50,792 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:50,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2110557727, now seen corresponding path program 1 times [2024-11-12 01:43:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618978992] [2024-11-12 01:43:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:43:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:43:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:43:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:43:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:43:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:43:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:43:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:43:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:43:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:43:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:43:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:43:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:43:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:43:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:43:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:43:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:43:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:43:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:43:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:43:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:43:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:43:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:43:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:43:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:43:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:43:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:43:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:43:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:43:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618978992] [2024-11-12 01:43:51,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618978992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:43:51,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:43:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:43:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599336043] [2024-11-12 01:43:51,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:43:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:43:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:43:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:43:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:43:51,329 INFO L87 Difference]: Start difference. First operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:43:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:43:51,360 INFO L93 Difference]: Finished difference Result 136 states and 237 transitions. [2024-11-12 01:43:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:43:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-11-12 01:43:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:43:51,368 INFO L225 Difference]: With dead ends: 136 [2024-11-12 01:43:51,368 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 01:43:51,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:43:51,377 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:43:51,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:43:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 01:43:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 01:43:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:43:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-12 01:43:51,427 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2024-11-12 01:43:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:43:51,429 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-12 01:43:51,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:43:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-12 01:43:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:43:51,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:51,432 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:51,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:43:51,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 296320473, now seen corresponding path program 1 times [2024-11-12 01:43:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981001779] [2024-11-12 01:43:51,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:43:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:43:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:43:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:43:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:43:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:43:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:43:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:43:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:43:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:43:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:43:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:43:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:43:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:43:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:43:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:43:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:43:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:43:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:43:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:43:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:43:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:43:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:43:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:43:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:43:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:43:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:43:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:43:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:43:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981001779] [2024-11-12 01:43:52,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981001779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:43:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:43:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:43:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537510764] [2024-11-12 01:43:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:43:52,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:43:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:43:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:43:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:43:52,057 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:43:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:43:52,265 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2024-11-12 01:43:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:43:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-11-12 01:43:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:43:52,270 INFO L225 Difference]: With dead ends: 193 [2024-11-12 01:43:52,270 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 01:43:52,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:43:52,271 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:43:52,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:43:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 01:43:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-11-12 01:43:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:43:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-12 01:43:52,308 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2024-11-12 01:43:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:43:52,310 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-12 01:43:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:43:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-12 01:43:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:43:52,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:52,314 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:43:52,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 554485911, now seen corresponding path program 1 times [2024-11-12 01:43:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269872096] [2024-11-12 01:43:52,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:43:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:43:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:43:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:43:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:43:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:43:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:43:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:43:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:43:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:43:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:43:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:43:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:43:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:43:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:43:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:43:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:43:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:43:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:43:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:43:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:43:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:43:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:43:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:43:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:43:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:43:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:43:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 30 proven. 48 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 01:43:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:43:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269872096] [2024-11-12 01:43:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269872096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:43:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610106622] [2024-11-12 01:43:52,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:52,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:43:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:43:52,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:43:52,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:43:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:43:53,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 01:43:53,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:43:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 944 proven. 120 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-12 01:43:53,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:43:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 69 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-11-12 01:43:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610106622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:43:54,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:43:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 10] total 27 [2024-11-12 01:43:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310830516] [2024-11-12 01:43:54,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:43:54,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-12 01:43:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:43:54,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 01:43:54,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2024-11-12 01:43:54,321 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2024-11-12 01:43:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:43:57,041 INFO L93 Difference]: Finished difference Result 485 states and 640 transitions. [2024-11-12 01:43:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-12 01:43:57,042 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) Word has length 167 [2024-11-12 01:43:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:43:57,049 INFO L225 Difference]: With dead ends: 485 [2024-11-12 01:43:57,049 INFO L226 Difference]: Without dead ends: 422 [2024-11-12 01:43:57,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2307, Invalid=7793, Unknown=0, NotChecked=0, Total=10100 [2024-11-12 01:43:57,057 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 598 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:43:57,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 721 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 01:43:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-12 01:43:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 384. [2024-11-12 01:43:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 217 states have (on average 1.064516129032258) internal successors, (231), 219 states have internal predecessors, (231), 135 states have call successors, (135), 31 states have call predecessors, (135), 31 states have return successors, (135), 133 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-12 01:43:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 501 transitions. [2024-11-12 01:43:57,143 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 501 transitions. Word has length 167 [2024-11-12 01:43:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:43:57,144 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 501 transitions. [2024-11-12 01:43:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 24 states have internal predecessors, (105), 11 states have call successors, (70), 5 states have call predecessors, (70), 9 states have return successors, (71), 11 states have call predecessors, (71), 11 states have call successors, (71) [2024-11-12 01:43:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2024-11-12 01:43:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:43:57,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:43:57,146 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:43:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:43:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:43:57,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:43:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:43:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 556332953, now seen corresponding path program 1 times [2024-11-12 01:43:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:43:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357531711] [2024-11-12 01:43:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:43:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:43:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:43:57,418 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:43:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:43:57,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:43:57,514 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:43:57,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:43:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:43:57,519 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:43:57,609 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:43:57,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:43:57 BoogieIcfgContainer [2024-11-12 01:43:57,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:43:57,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:43:57,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:43:57,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:43:57,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:43:50" (3/4) ... [2024-11-12 01:43:57,618 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:43:57,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:43:57,624 INFO L158 Benchmark]: Toolchain (without parser) took 7815.20ms. Allocated memory was 144.7MB in the beginning and 245.4MB in the end (delta: 100.7MB). Free memory was 74.9MB in the beginning and 150.3MB in the end (delta: -75.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,625 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:43:57,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.18ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 107.5MB in the end (delta: -32.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.59ms. Allocated memory is still 144.7MB. Free memory was 107.5MB in the beginning and 104.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,629 INFO L158 Benchmark]: Boogie Preprocessor took 61.71ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 99.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,629 INFO L158 Benchmark]: RCFGBuilder took 394.90ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 78.2MB in the end (delta: 20.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,629 INFO L158 Benchmark]: TraceAbstraction took 6922.82ms. Allocated memory was 144.7MB in the beginning and 245.4MB in the end (delta: 100.7MB). Free memory was 77.5MB in the beginning and 150.3MB in the end (delta: -72.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-12 01:43:57,629 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 245.4MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:43:57,630 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.17ms. Allocated memory is still 144.7MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.18ms. Allocated memory is still 144.7MB. Free memory was 74.6MB in the beginning and 107.5MB in the end (delta: -32.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.59ms. Allocated memory is still 144.7MB. Free memory was 107.5MB in the beginning and 104.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.71ms. Allocated memory is still 144.7MB. Free memory was 104.3MB in the beginning and 99.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.90ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 78.2MB in the end (delta: 20.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6922.82ms. Allocated memory was 144.7MB in the beginning and 245.4MB in the end (delta: 100.7MB). Free memory was 77.5MB in the beginning and 150.3MB in the end (delta: -72.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 245.4MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L132] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L97] var_1_10 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L101] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L102] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L104] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L106] var_1_18 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L107] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L108] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L110] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L111] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L121] var_1_25 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L124] var_1_28 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L126] var_1_29 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L127] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] var_1_30 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L129] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET updateVariables() [L144] CALL step() [L48] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L51] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L52] COND TRUE \read(var_1_4) [L53] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L57] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L58] COND FALSE !(var_1_23 < var_1_23) [L69] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L71] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L72] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L79] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L81] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L84] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-96, var_1_18=-1, var_1_19=0, var_1_1=126, var_1_20=63, var_1_21=63, var_1_22=31, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 754 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 754 mSolverCounterUnsat, 310 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=3, InterpolantAutomatonStates: 94, 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, 3 MinimizatonAttempts, 53 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359 SizeOfPredicates, 6 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6783/7020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:43:57,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:43:59,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:43:59,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:43:59,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:43:59,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:43:59,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:43:59,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:43:59,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:43:59,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:43:59,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:43:59,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:43:59,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:43:59,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:43:59,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:43:59,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:43:59,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:43:59,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:43:59,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:43:59,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:43:59,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:43:59,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:43:59,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:43:59,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:43:59,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:43:59,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:43:59,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:43:59,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:43:59,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:43:59,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:43:59,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:43:59,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:43:59,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:43:59,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:43:59,769 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:43:59,769 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:43:59,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:43:59,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:43:59,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:43:59,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:43:59,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25c099cafcf146fe288326928d8684d9ffb8051a2d7ac8654f04f5ad2b905361 [2024-11-12 01:44:00,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:44:00,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:44:00,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:44:00,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:44:00,092 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:44:00,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:44:01,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:44:01,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:44:01,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:44:01,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86e0bc69/166f643517c04bc9a2387855d46e073f/FLAGeab6d0a94 [2024-11-12 01:44:01,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86e0bc69/166f643517c04bc9a2387855d46e073f [2024-11-12 01:44:01,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:44:01,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:44:01,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:01,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:44:01,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:44:01,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:01" (1/1) ... [2024-11-12 01:44:01,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@954b9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:01, skipping insertion in model container [2024-11-12 01:44:01,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:01" (1/1) ... [2024-11-12 01:44:01,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:44:01,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i[913,926] [2024-11-12 01:44:01,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:01,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:44:01,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-96.i[913,926] [2024-11-12 01:44:02,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:02,030 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:44:02,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02 WrapperNode [2024-11-12 01:44:02,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:02,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:02,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:44:02,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:44:02,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,073 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-12 01:44:02,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:02,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:44:02,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:44:02,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:44:02,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,108 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:44:02,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:44:02,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:44:02,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:44:02,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:44:02,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (1/1) ... [2024-11-12 01:44:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:44:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:44:02,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:44:02,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:44:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:44:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:44:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:44:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:44:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:44:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:44:02,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:44:02,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:44:05,055 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 01:44:05,055 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:44:05,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:44:05,068 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:44:05,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:05 BoogieIcfgContainer [2024-11-12 01:44:05,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:44:05,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:44:05,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:44:05,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:44:05,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:44:01" (1/3) ... [2024-11-12 01:44:05,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46519b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:05, skipping insertion in model container [2024-11-12 01:44:05,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:02" (2/3) ... [2024-11-12 01:44:05,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46519b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:05, skipping insertion in model container [2024-11-12 01:44:05,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:05" (3/3) ... [2024-11-12 01:44:05,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-96.i [2024-11-12 01:44:05,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:44:05,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:44:05,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:44:05,164 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;@79a33ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:44:05,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:44:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:44:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:44:05,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:05,183 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:05,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:05,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2110557727, now seen corresponding path program 1 times [2024-11-12 01:44:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:05,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567429603] [2024-11-12 01:44:05,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:05,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:05,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:44:05,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:44:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:05,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:44:05,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-12 01:44:05,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:05,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567429603] [2024-11-12 01:44:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567429603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:44:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456723179] [2024-11-12 01:44:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:05,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:44:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:44:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:44:05,632 INFO L87 Difference]: Start difference. First operand has 73 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:44:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:05,664 INFO L93 Difference]: Finished difference Result 136 states and 237 transitions. [2024-11-12 01:44:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:44:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-11-12 01:44:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:05,673 INFO L225 Difference]: With dead ends: 136 [2024-11-12 01:44:05,673 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 01:44:05,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:44:05,681 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:05,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:44:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 01:44:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 01:44:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:44:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-12 01:44:05,731 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2024-11-12 01:44:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-12 01:44:05,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:44:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-12 01:44:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:44:05,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:05,736 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:05,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:44:05,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:05,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 296320473, now seen corresponding path program 1 times [2024-11-12 01:44:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049623738] [2024-11-12 01:44:05,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:05,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:44:05,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:44:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:06,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 01:44:06,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:44:07,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:07,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049623738] [2024-11-12 01:44:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049623738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:07,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189918295] [2024-11-12 01:44:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:07,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:44:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:44:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:44:07,049 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:44:08,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:44:09,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:44:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:10,468 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2024-11-12 01:44:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:44:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-11-12 01:44:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:10,490 INFO L225 Difference]: With dead ends: 193 [2024-11-12 01:44:10,490 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 01:44:10,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:10,492 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:10,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 271 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-12 01:44:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 01:44:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2024-11-12 01:44:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:44:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2024-11-12 01:44:10,530 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2024-11-12 01:44:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2024-11-12 01:44:10,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:44:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2024-11-12 01:44:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:44:10,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:10,532 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:10,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:44:10,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:10,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:10,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 554485911, now seen corresponding path program 1 times [2024-11-12 01:44:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:10,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783690183] [2024-11-12 01:44:10,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:10,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:10,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:44:10,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:44:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:10,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 01:44:10,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 928 proven. 108 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-12 01:44:12,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:44:12,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783690183] [2024-11-12 01:44:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783690183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:44:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1913705601] [2024-11-12 01:44:12,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:12,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 01:44:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 01:44:12,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 01:44:12,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-12 01:44:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:13,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 01:44:13,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 686 proven. 48 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-11-12 01:44:13,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:44:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1913705601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:44:14,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:44:14,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-11-12 01:44:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345169029] [2024-11-12 01:44:14,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:44:14,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 01:44:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 01:44:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:44:14,164 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-12 01:44:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:18,144 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2024-11-12 01:44:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 01:44:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2024-11-12 01:44:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:18,152 INFO L225 Difference]: With dead ends: 289 [2024-11-12 01:44:18,152 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 01:44:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 01:44:18,154 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 146 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:18,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 385 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-12 01:44:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 01:44:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2024-11-12 01:44:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 112 states have (on average 1.0625) internal successors, (119), 113 states have internal predecessors, (119), 81 states have call successors, (81), 13 states have call predecessors, (81), 13 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-12 01:44:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2024-11-12 01:44:18,193 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 167 [2024-11-12 01:44:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2024-11-12 01:44:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-11-12 01:44:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2024-11-12 01:44:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:44:18,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:18,199 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:44:18,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 01:44:18,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-12 01:44:18,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 01:44:18,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:18,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 556332953, now seen corresponding path program 1 times [2024-11-12 01:44:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:18,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849055866] [2024-11-12 01:44:18,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:44:18,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:18,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:44:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 01:44:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:18,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 01:44:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates...